/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:15:53,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:15:53,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:15:53,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:15:53,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:15:53,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:15:53,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:15:53,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:15:53,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:15:53,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:15:53,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:15:53,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:15:53,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:15:53,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:15:53,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:15:53,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:15:53,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:15:53,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:15:53,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:15:53,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:15:53,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:15:53,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:15:53,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:15:53,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:15:53,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:15:53,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:15:53,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:15:53,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:15:53,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:15:53,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:15:53,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:15:53,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:15:53,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:15:53,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:15:53,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:15:53,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:15:53,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:15:53,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:15:53,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:15:53,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:15:53,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:15:53,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:15:53,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:15:53,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:15:53,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:15:53,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:15:53,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:15:53,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:15:53,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:15:53,973 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:15:53,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:15:53,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:15:53,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:15:53,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:15:53,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:15:53,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:15:53,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:15:53,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:15:53,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:15:53,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:15:53,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:15:53,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:15:53,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:15:53,975 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:15:53,975 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:15:53,975 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:15:53,975 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:15:54,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:15:54,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:15:54,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:15:54,164 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:15:54,165 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:15:54,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.oepc.i [2021-03-26 00:15:54,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcaf2d99/c35e947c6e844a128e0a2ab57fb9433a/FLAGbdaf9fe89 [2021-03-26 00:15:54,693 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:15:54,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.oepc.i [2021-03-26 00:15:54,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcaf2d99/c35e947c6e844a128e0a2ab57fb9433a/FLAGbdaf9fe89 [2021-03-26 00:15:55,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcaf2d99/c35e947c6e844a128e0a2ab57fb9433a [2021-03-26 00:15:55,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:15:55,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:15:55,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:55,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:15:55,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:15:55,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ae7be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55, skipping insertion in model container [2021-03-26 00:15:55,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:15:55,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:15:55,333 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/mix036_rmo.oepc.i[949,962] [2021-03-26 00:15:55,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:55,534 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:15:55,541 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/mix036_rmo.oepc.i[949,962] [2021-03-26 00:15:55,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:55,647 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:15:55,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55 WrapperNode [2021-03-26 00:15:55,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:55,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:55,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:15:55,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:15:55,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:55,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:15:55,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:15:55,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:15:55,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... [2021-03-26 00:15:55,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:15:55,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:15:55,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:15:55,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:15:55,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:15:55,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:15:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:15:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:15:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:15:55,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:15:55,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:15:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:15:55,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:15:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:15:55,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:15:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:15:55,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:15:55,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:15:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:15:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:15:55,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:15:55,806 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:15:57,487 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:15:57,488 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:15:57,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:57 BoogieIcfgContainer [2021-03-26 00:15:57,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:15:57,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:15:57,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:15:57,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:15:57,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:15:55" (1/3) ... [2021-03-26 00:15:57,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b34507e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:57, skipping insertion in model container [2021-03-26 00:15:57,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:55" (2/3) ... [2021-03-26 00:15:57,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b34507e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:57, skipping insertion in model container [2021-03-26 00:15:57,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:57" (3/3) ... [2021-03-26 00:15:57,496 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_rmo.oepc.i [2021-03-26 00:15:57,500 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:15:57,502 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:15:57,503 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,544 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,544 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,575 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,575 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:57,578 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:15:57,590 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:15:57,612 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:15:57,612 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:15:57,612 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:15:57,612 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:15:57,612 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:15:57,612 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:15:57,612 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:15:57,612 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:15:57,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-26 00:15:57,662 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-26 00:15:57,662 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:57,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:15:57,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-26 00:15:57,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:57,677 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:57,685 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:57,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:57,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-26 00:15:57,714 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-26 00:15:57,714 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:57,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 00:15:57,718 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-26 00:15:58,913 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:15:59,242 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:16:00,459 INFO L154 LiptonReduction]: Checked pairs total: 5389 [2021-03-26 00:16:00,459 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-26 00:16:00,462 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2786 [2021-03-26 00:16:00,470 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:16:00,470 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:00,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:00,471 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:00,471 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1113703675, now seen corresponding path program 1 times [2021-03-26 00:16:00,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:00,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227976485] [2021-03-26 00:16:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:00,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:00,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:00,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:00,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:00,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227976485] [2021-03-26 00:16:00,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:00,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:16:00,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392013624] [2021-03-26 00:16:00,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:16:00,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:16:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:16:00,677 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 199 [2021-03-26 00:16:00,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:00,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:00,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 199 [2021-03-26 00:16:00,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:00,782 INFO L129 PetriNetUnfolder]: 133/371 cut-off events. [2021-03-26 00:16:00,782 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:00,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 371 events. 133/371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2040 event pairs, 110 based on Foata normal form. 33/376 useless extension candidates. Maximal degree in co-relation 567. Up to 153 conditions per place. [2021-03-26 00:16:00,787 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 00:16:00,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-26 00:16:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:16:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:16:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 00:16:00,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.916247906197655 [2021-03-26 00:16:00,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 00:16:00,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 00:16:00,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:00,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 00:16:00,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:00,821 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-26 00:16:00,821 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-26 00:16:00,822 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 547 transitions. [2021-03-26 00:16:00,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-26 00:16:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:16:00,826 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:00,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 00:16:00,853 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 00:16:00,853 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:00,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:00,853 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:00,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 00:16:00,857 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 00:16:00,857 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:00,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:16:00,858 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-26 00:16:02,329 INFO L154 LiptonReduction]: Checked pairs total: 2683 [2021-03-26 00:16:02,329 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 00:16:02,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1476 [2021-03-26 00:16:02,330 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-03-26 00:16:02,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:02,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:02,331 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:02,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:16:02,331 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 460839235, now seen corresponding path program 1 times [2021-03-26 00:16:02,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:02,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868097328] [2021-03-26 00:16:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:02,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:02,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:02,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:02,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:02,412 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:16:02,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:16:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:02,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868097328] [2021-03-26 00:16:02,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:02,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:02,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209454236] [2021-03-26 00:16:02,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:02,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:02,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 213 [2021-03-26 00:16:02,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:02,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:02,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 213 [2021-03-26 00:16:02,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:02,438 INFO L129 PetriNetUnfolder]: 1/34 cut-off events. [2021-03-26 00:16:02,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:02,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2021-03-26 00:16:02,439 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 1 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2021-03-26 00:16:02,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 92 flow [2021-03-26 00:16:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:16:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:16:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2021-03-26 00:16:02,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8845070422535212 [2021-03-26 00:16:02,441 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 942 transitions. [2021-03-26 00:16:02,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 942 transitions. [2021-03-26 00:16:02,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:02,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 942 transitions. [2021-03-26 00:16:02,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:02,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:02,445 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:02,446 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 942 transitions. [2021-03-26 00:16:02,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 92 flow [2021-03-26 00:16:02,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:02,446 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 76 flow [2021-03-26 00:16:02,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2021-03-26 00:16:02,447 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -15 predicate places. [2021-03-26 00:16:02,447 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:02,447 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 76 flow [2021-03-26 00:16:02,447 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 76 flow [2021-03-26 00:16:02,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 76 flow [2021-03-26 00:16:02,450 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:16:02,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:02,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:16:02,450 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-26 00:16:03,214 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:16:03,370 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:16:03,681 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:16:03,829 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:16:03,832 INFO L154 LiptonReduction]: Checked pairs total: 1444 [2021-03-26 00:16:03,832 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:16:03,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1385 [2021-03-26 00:16:03,833 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-03-26 00:16:03,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:03,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:03,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:03,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:16:03,834 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:03,834 INFO L82 PathProgramCache]: Analyzing trace with hash -79801966, now seen corresponding path program 1 times [2021-03-26 00:16:03,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:03,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035003817] [2021-03-26 00:16:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:03,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:03,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:03,883 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:03,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:03,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:03,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:03,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035003817] [2021-03-26 00:16:03,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:03,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:03,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500449367] [2021-03-26 00:16:03,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:03,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:03,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 00:16:03,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:03,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:03,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 00:16:03,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:03,925 INFO L129 PetriNetUnfolder]: 90/186 cut-off events. [2021-03-26 00:16:03,926 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:16:03,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 186 events. 90/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 805 event pairs, 46 based on Foata normal form. 16/199 useless extension candidates. Maximal degree in co-relation 358. Up to 119 conditions per place. [2021-03-26 00:16:03,927 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 5 changer transitions 9/40 dead transitions. [2021-03-26 00:16:03,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 136 flow [2021-03-26 00:16:03,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:16:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:16:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-26 00:16:03,931 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2021-03-26 00:16:03,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-26 00:16:03,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-26 00:16:03,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:03,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-26 00:16:03,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:03,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:03,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:03,935 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 5 states and 912 transitions. [2021-03-26 00:16:03,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 136 flow [2021-03-26 00:16:03,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:03,936 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow [2021-03-26 00:16:03,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-26 00:16:03,937 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -17 predicate places. [2021-03-26 00:16:03,937 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:03,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 111 flow [2021-03-26 00:16:03,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 111 flow [2021-03-26 00:16:03,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2021-03-26 00:16:03,950 INFO L129 PetriNetUnfolder]: 73/145 cut-off events. [2021-03-26 00:16:03,950 INFO L130 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2021-03-26 00:16:03,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 145 events. 73/145 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 494 event pairs, 40 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 378. Up to 104 conditions per place. [2021-03-26 00:16:03,952 INFO L142 LiptonReduction]: Number of co-enabled transitions 446 [2021-03-26 00:16:03,963 INFO L154 LiptonReduction]: Checked pairs total: 422 [2021-03-26 00:16:03,963 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:03,963 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 00:16:03,967 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2021-03-26 00:16:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:03,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:03,968 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:03,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:16:03,968 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1225209707, now seen corresponding path program 1 times [2021-03-26 00:16:03,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:03,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210138402] [2021-03-26 00:16:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:04,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:04,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:04,068 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:04,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:04,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:04,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210138402] [2021-03-26 00:16:04,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:04,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:16:04,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174706189] [2021-03-26 00:16:04,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:16:04,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:16:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:16:04,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 00:16:04,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:04,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 00:16:04,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:04,127 INFO L129 PetriNetUnfolder]: 66/149 cut-off events. [2021-03-26 00:16:04,127 INFO L130 PetriNetUnfolder]: For 102/123 co-relation queries the response was YES. [2021-03-26 00:16:04,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 149 events. 66/149 cut-off events. For 102/123 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 559 event pairs, 14 based on Foata normal form. 22/168 useless extension candidates. Maximal degree in co-relation 504. Up to 108 conditions per place. [2021-03-26 00:16:04,128 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 9 changer transitions 9/44 dead transitions. [2021-03-26 00:16:04,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 235 flow [2021-03-26 00:16:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:16:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:16:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2021-03-26 00:16:04,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441358024691358 [2021-03-26 00:16:04,130 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2021-03-26 00:16:04,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2021-03-26 00:16:04,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:04,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2021-03-26 00:16:04,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,135 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,135 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 6 states and 1094 transitions. [2021-03-26 00:16:04,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 235 flow [2021-03-26 00:16:04,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:04,138 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow [2021-03-26 00:16:04,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-26 00:16:04,138 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -13 predicate places. [2021-03-26 00:16:04,138 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:04,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 176 flow [2021-03-26 00:16:04,138 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 176 flow [2021-03-26 00:16:04,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 176 flow [2021-03-26 00:16:04,149 INFO L129 PetriNetUnfolder]: 49/117 cut-off events. [2021-03-26 00:16:04,149 INFO L130 PetriNetUnfolder]: For 200/216 co-relation queries the response was YES. [2021-03-26 00:16:04,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 117 events. 49/117 cut-off events. For 200/216 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 421 event pairs, 13 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 436. Up to 76 conditions per place. [2021-03-26 00:16:04,151 INFO L142 LiptonReduction]: Number of co-enabled transitions 530 [2021-03-26 00:16:04,164 INFO L154 LiptonReduction]: Checked pairs total: 503 [2021-03-26 00:16:04,164 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:04,164 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 00:16:04,166 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 176 flow [2021-03-26 00:16:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,167 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:04,167 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:04,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:16:04,167 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash 598660123, now seen corresponding path program 1 times [2021-03-26 00:16:04,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:04,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198509658] [2021-03-26 00:16:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:04,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:04,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:04,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:04,257 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:04,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:04,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:04,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198509658] [2021-03-26 00:16:04,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:04,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:16:04,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317017204] [2021-03-26 00:16:04,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:16:04,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:16:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:16:04,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2021-03-26 00:16:04,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:04,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2021-03-26 00:16:04,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:04,330 INFO L129 PetriNetUnfolder]: 36/97 cut-off events. [2021-03-26 00:16:04,330 INFO L130 PetriNetUnfolder]: For 204/246 co-relation queries the response was YES. [2021-03-26 00:16:04,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 97 events. 36/97 cut-off events. For 204/246 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 280 event pairs, 2 based on Foata normal form. 25/119 useless extension candidates. Maximal degree in co-relation 432. Up to 68 conditions per place. [2021-03-26 00:16:04,331 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 13 changer transitions 9/48 dead transitions. [2021-03-26 00:16:04,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 358 flow [2021-03-26 00:16:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:16:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:16:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1276 transitions. [2021-03-26 00:16:04,333 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.843915343915344 [2021-03-26 00:16:04,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1276 transitions. [2021-03-26 00:16:04,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1276 transitions. [2021-03-26 00:16:04,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:04,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1276 transitions. [2021-03-26 00:16:04,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.28571428571428) internal successors, (1276), 7 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,362 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,362 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 176 flow. Second operand 7 states and 1276 transitions. [2021-03-26 00:16:04,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 358 flow [2021-03-26 00:16:04,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:16:04,364 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 226 flow [2021-03-26 00:16:04,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2021-03-26 00:16:04,364 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2021-03-26 00:16:04,364 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:04,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 226 flow [2021-03-26 00:16:04,365 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 226 flow [2021-03-26 00:16:04,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 226 flow [2021-03-26 00:16:04,374 INFO L129 PetriNetUnfolder]: 25/75 cut-off events. [2021-03-26 00:16:04,374 INFO L130 PetriNetUnfolder]: For 160/176 co-relation queries the response was YES. [2021-03-26 00:16:04,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 75 events. 25/75 cut-off events. For 160/176 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 2 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 271. Up to 42 conditions per place. [2021-03-26 00:16:04,375 INFO L142 LiptonReduction]: Number of co-enabled transitions 530 [2021-03-26 00:16:04,378 INFO L154 LiptonReduction]: Checked pairs total: 613 [2021-03-26 00:16:04,378 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:04,379 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 00:16:04,381 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 226 flow [2021-03-26 00:16:04,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:04,382 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-26 00:16:04,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:16:04,382 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1278353626, now seen corresponding path program 1 times [2021-03-26 00:16:04,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:04,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408114220] [2021-03-26 00:16:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:04,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:04,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:04,462 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 00:16:04,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:16:04,473 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 00:16:04,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:16:04,484 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-03-26 00:16:04,485 INFO L147 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size 9 [2021-03-26 00:16:04,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:04,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:16:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:04,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408114220] [2021-03-26 00:16:04,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:04,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:16:04,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516179963] [2021-03-26 00:16:04,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:16:04,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:16:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:16:04,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 216 [2021-03-26 00:16:04,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:04,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 216 [2021-03-26 00:16:04,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:04,837 INFO L129 PetriNetUnfolder]: 915/1684 cut-off events. [2021-03-26 00:16:04,837 INFO L130 PetriNetUnfolder]: For 2376/2679 co-relation queries the response was YES. [2021-03-26 00:16:04,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 1684 events. 915/1684 cut-off events. For 2376/2679 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10385 event pairs, 96 based on Foata normal form. 106/1734 useless extension candidates. Maximal degree in co-relation 4709. Up to 558 conditions per place. [2021-03-26 00:16:04,848 INFO L132 encePairwiseOnDemand]: 202/216 looper letters, 41 selfloop transitions, 28 changer transitions 2/96 dead transitions. [2021-03-26 00:16:04,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 523 flow [2021-03-26 00:16:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:16:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:16:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1487 transitions. [2021-03-26 00:16:04,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7649176954732511 [2021-03-26 00:16:04,851 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1487 transitions. [2021-03-26 00:16:04,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1487 transitions. [2021-03-26 00:16:04,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:04,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1487 transitions. [2021-03-26 00:16:04,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 165.22222222222223) internal successors, (1487), 9 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,856 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:04,856 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 226 flow. Second operand 9 states and 1487 transitions. [2021-03-26 00:16:04,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 523 flow [2021-03-26 00:16:04,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 449 flow, removed 28 selfloop flow, removed 5 redundant places. [2021-03-26 00:16:04,875 INFO L241 Difference]: Finished difference. Result has 59 places, 66 transitions, 392 flow [2021-03-26 00:16:04,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=392, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2021-03-26 00:16:04,875 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2021-03-26 00:16:04,875 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:04,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 66 transitions, 392 flow [2021-03-26 00:16:04,876 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 66 transitions, 392 flow [2021-03-26 00:16:04,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 66 transitions, 392 flow [2021-03-26 00:16:04,977 INFO L129 PetriNetUnfolder]: 632/1380 cut-off events. [2021-03-26 00:16:04,977 INFO L130 PetriNetUnfolder]: For 1594/1910 co-relation queries the response was YES. [2021-03-26 00:16:04,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 1380 events. 632/1380 cut-off events. For 1594/1910 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9692 event pairs, 157 based on Foata normal form. 79/1348 useless extension candidates. Maximal degree in co-relation 4232. Up to 509 conditions per place. [2021-03-26 00:16:05,011 INFO L142 LiptonReduction]: Number of co-enabled transitions 894 [2021-03-26 00:16:05,280 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:05,402 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:05,532 INFO L154 LiptonReduction]: Checked pairs total: 197 [2021-03-26 00:16:05,533 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:16:05,533 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 658 [2021-03-26 00:16:05,538 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 400 flow [2021-03-26 00:16:05,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:05,539 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:05,539 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-26 00:16:05,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:16:05,539 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2044335412, now seen corresponding path program 2 times [2021-03-26 00:16:05,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:05,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363690296] [2021-03-26 00:16:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:05,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:05,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:05,651 INFO L142 QuantifierPusher]: treesize reduction 13, result has 72.3 percent of original size [2021-03-26 00:16:05,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 00:16:05,667 INFO L142 QuantifierPusher]: treesize reduction 19, result has 76.5 percent of original size [2021-03-26 00:16:05,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 00:16:05,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:05,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:16:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:05,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363690296] [2021-03-26 00:16:05,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:05,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:16:05,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647951153] [2021-03-26 00:16:05,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:16:05,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:16:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:16:05,698 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 218 [2021-03-26 00:16:05,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:05,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:05,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 218 [2021-03-26 00:16:05,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:06,030 INFO L129 PetriNetUnfolder]: 1002/2205 cut-off events. [2021-03-26 00:16:06,030 INFO L130 PetriNetUnfolder]: For 3824/4756 co-relation queries the response was YES. [2021-03-26 00:16:06,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 2205 events. 1002/2205 cut-off events. For 3824/4756 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17105 event pairs, 94 based on Foata normal form. 222/2298 useless extension candidates. Maximal degree in co-relation 7592. Up to 693 conditions per place. [2021-03-26 00:16:06,045 INFO L132 encePairwiseOnDemand]: 208/218 looper letters, 20 selfloop transitions, 23 changer transitions 2/88 dead transitions. [2021-03-26 00:16:06,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 636 flow [2021-03-26 00:16:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:16:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:16:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2021-03-26 00:16:06,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7595019659239842 [2021-03-26 00:16:06,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1159 transitions. [2021-03-26 00:16:06,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1159 transitions. [2021-03-26 00:16:06,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:06,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1159 transitions. [2021-03-26 00:16:06,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.57142857142858) internal successors, (1159), 7 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:06,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:06,052 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:06,052 INFO L185 Difference]: Start difference. First operand has 59 places, 66 transitions, 400 flow. Second operand 7 states and 1159 transitions. [2021-03-26 00:16:06,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 636 flow [2021-03-26 00:16:06,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 632 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 00:16:06,075 INFO L241 Difference]: Finished difference. Result has 68 places, 79 transitions, 568 flow [2021-03-26 00:16:06,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=568, PETRI_PLACES=68, PETRI_TRANSITIONS=79} [2021-03-26 00:16:06,075 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2021-03-26 00:16:06,076 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:06,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 79 transitions, 568 flow [2021-03-26 00:16:06,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 79 transitions, 568 flow [2021-03-26 00:16:06,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 79 transitions, 568 flow [2021-03-26 00:16:06,251 INFO L129 PetriNetUnfolder]: 952/2125 cut-off events. [2021-03-26 00:16:06,251 INFO L130 PetriNetUnfolder]: For 4240/4889 co-relation queries the response was YES. [2021-03-26 00:16:06,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7462 conditions, 2125 events. 952/2125 cut-off events. For 4240/4889 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16823 event pairs, 152 based on Foata normal form. 178/2172 useless extension candidates. Maximal degree in co-relation 7437. Up to 662 conditions per place. [2021-03-26 00:16:06,282 INFO L142 LiptonReduction]: Number of co-enabled transitions 1174 [2021-03-26 00:16:06,592 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:06,707 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:07,072 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:16:07,238 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:16:07,331 INFO L154 LiptonReduction]: Checked pairs total: 243 [2021-03-26 00:16:07,331 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:16:07,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1255 [2021-03-26 00:16:07,332 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 79 transitions, 584 flow [2021-03-26 00:16:07,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:07,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:07,332 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:07,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:16:07,332 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1623775758, now seen corresponding path program 1 times [2021-03-26 00:16:07,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:07,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025627696] [2021-03-26 00:16:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:07,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:07,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:07,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:07,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:07,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:07,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:07,396 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:16:07,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:16:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:07,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025627696] [2021-03-26 00:16:07,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:07,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:16:07,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050074377] [2021-03-26 00:16:07,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:16:07,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:16:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:16:07,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 220 [2021-03-26 00:16:07,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 79 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:07,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:07,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 220 [2021-03-26 00:16:07,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:07,660 INFO L129 PetriNetUnfolder]: 1203/2617 cut-off events. [2021-03-26 00:16:07,660 INFO L130 PetriNetUnfolder]: For 6433/7752 co-relation queries the response was YES. [2021-03-26 00:16:07,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9706 conditions, 2617 events. 1203/2617 cut-off events. For 6433/7752 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20769 event pairs, 145 based on Foata normal form. 301/2740 useless extension candidates. Maximal degree in co-relation 9679. Up to 819 conditions per place. [2021-03-26 00:16:07,679 INFO L132 encePairwiseOnDemand]: 212/220 looper letters, 25 selfloop transitions, 15 changer transitions 1/92 dead transitions. [2021-03-26 00:16:07,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 779 flow [2021-03-26 00:16:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:16:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:16:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1078 transitions. [2021-03-26 00:16:07,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2021-03-26 00:16:07,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1078 transitions. [2021-03-26 00:16:07,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1078 transitions. [2021-03-26 00:16:07,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:07,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1078 transitions. [2021-03-26 00:16:07,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:07,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:07,686 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:07,686 INFO L185 Difference]: Start difference. First operand has 68 places, 79 transitions, 584 flow. Second operand 6 states and 1078 transitions. [2021-03-26 00:16:07,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 779 flow [2021-03-26 00:16:07,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 776 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:16:07,724 INFO L241 Difference]: Finished difference. Result has 74 places, 81 transitions, 640 flow [2021-03-26 00:16:07,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2021-03-26 00:16:07,724 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2021-03-26 00:16:07,724 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:07,724 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 81 transitions, 640 flow [2021-03-26 00:16:07,725 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 81 transitions, 640 flow [2021-03-26 00:16:07,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 81 transitions, 640 flow [2021-03-26 00:16:07,937 INFO L129 PetriNetUnfolder]: 1109/2497 cut-off events. [2021-03-26 00:16:07,938 INFO L130 PetriNetUnfolder]: For 5797/6700 co-relation queries the response was YES. [2021-03-26 00:16:07,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8909 conditions, 2497 events. 1109/2497 cut-off events. For 5797/6700 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20678 event pairs, 174 based on Foata normal form. 229/2588 useless extension candidates. Maximal degree in co-relation 8881. Up to 812 conditions per place. [2021-03-26 00:16:07,966 INFO L142 LiptonReduction]: Number of co-enabled transitions 1180 [2021-03-26 00:16:08,214 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:16:08,569 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:16:08,681 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:16:08,823 INFO L154 LiptonReduction]: Checked pairs total: 447 [2021-03-26 00:16:08,823 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:16:08,823 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1099 [2021-03-26 00:16:08,823 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 648 flow [2021-03-26 00:16:08,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:08,824 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:08,824 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:08,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:16:08,824 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1259430643, now seen corresponding path program 1 times [2021-03-26 00:16:08,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:08,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441604832] [2021-03-26 00:16:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:08,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:08,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:08,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:08,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:08,857 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:16:08,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:16:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:08,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441604832] [2021-03-26 00:16:08,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:08,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:08,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261217535] [2021-03-26 00:16:08,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:08,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:08,866 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 222 [2021-03-26 00:16:08,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 648 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:08,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:08,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 222 [2021-03-26 00:16:08,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:09,302 INFO L129 PetriNetUnfolder]: 2045/4344 cut-off events. [2021-03-26 00:16:09,302 INFO L130 PetriNetUnfolder]: For 13195/15325 co-relation queries the response was YES. [2021-03-26 00:16:09,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16572 conditions, 4344 events. 2045/4344 cut-off events. For 13195/15325 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 37374 event pairs, 202 based on Foata normal form. 430/4478 useless extension candidates. Maximal degree in co-relation 16542. Up to 1365 conditions per place. [2021-03-26 00:16:09,332 INFO L132 encePairwiseOnDemand]: 211/222 looper letters, 27 selfloop transitions, 27 changer transitions 14/116 dead transitions. [2021-03-26 00:16:09,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 1085 flow [2021-03-26 00:16:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:16:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:16:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 900 transitions. [2021-03-26 00:16:09,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2021-03-26 00:16:09,335 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 900 transitions. [2021-03-26 00:16:09,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 900 transitions. [2021-03-26 00:16:09,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:09,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 900 transitions. [2021-03-26 00:16:09,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:09,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:09,338 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:09,338 INFO L185 Difference]: Start difference. First operand has 74 places, 81 transitions, 648 flow. Second operand 5 states and 900 transitions. [2021-03-26 00:16:09,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 1085 flow [2021-03-26 00:16:09,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 116 transitions, 1065 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:16:09,426 INFO L241 Difference]: Finished difference. Result has 79 places, 93 transitions, 862 flow [2021-03-26 00:16:09,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=862, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2021-03-26 00:16:09,426 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 18 predicate places. [2021-03-26 00:16:09,426 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:09,426 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 93 transitions, 862 flow [2021-03-26 00:16:09,426 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 93 transitions, 862 flow [2021-03-26 00:16:09,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 93 transitions, 862 flow [2021-03-26 00:16:09,802 INFO L129 PetriNetUnfolder]: 1886/4151 cut-off events. [2021-03-26 00:16:09,803 INFO L130 PetriNetUnfolder]: For 12271/13667 co-relation queries the response was YES. [2021-03-26 00:16:09,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15920 conditions, 4151 events. 1886/4151 cut-off events. For 12271/13667 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 37284 event pairs, 245 based on Foata normal form. 357/4285 useless extension candidates. Maximal degree in co-relation 15889. Up to 1321 conditions per place. [2021-03-26 00:16:09,855 INFO L142 LiptonReduction]: Number of co-enabled transitions 1344 [2021-03-26 00:16:09,960 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:16:09,961 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:09,961 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 535 [2021-03-26 00:16:09,962 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 862 flow [2021-03-26 00:16:09,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:09,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:09,962 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:09,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:16:09,962 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash -713891543, now seen corresponding path program 1 times [2021-03-26 00:16:09,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:09,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927215750] [2021-03-26 00:16:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:10,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:10,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:10,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:10,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:10,006 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:16:10,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:16:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:10,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927215750] [2021-03-26 00:16:10,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:10,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:16:10,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146763795] [2021-03-26 00:16:10,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:16:10,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:10,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:16:10,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:16:10,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 222 [2021-03-26 00:16:10,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 862 flow. Second operand has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:10,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:10,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 222 [2021-03-26 00:16:10,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:10,534 INFO L129 PetriNetUnfolder]: 2415/5204 cut-off events. [2021-03-26 00:16:10,534 INFO L130 PetriNetUnfolder]: For 17272/20197 co-relation queries the response was YES. [2021-03-26 00:16:10,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20806 conditions, 5204 events. 2415/5204 cut-off events. For 17272/20197 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 46810 event pairs, 289 based on Foata normal form. 544/5388 useless extension candidates. Maximal degree in co-relation 20773. Up to 1661 conditions per place. [2021-03-26 00:16:10,569 INFO L132 encePairwiseOnDemand]: 212/222 looper letters, 34 selfloop transitions, 32 changer transitions 1/117 dead transitions. [2021-03-26 00:16:10,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 1262 flow [2021-03-26 00:16:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:16:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:16:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 894 transitions. [2021-03-26 00:16:10,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8054054054054054 [2021-03-26 00:16:10,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 894 transitions. [2021-03-26 00:16:10,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 894 transitions. [2021-03-26 00:16:10,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:10,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 894 transitions. [2021-03-26 00:16:10,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:10,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:10,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:10,575 INFO L185 Difference]: Start difference. First operand has 79 places, 93 transitions, 862 flow. Second operand 5 states and 894 transitions. [2021-03-26 00:16:10,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 1262 flow [2021-03-26 00:16:10,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 1260 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 00:16:10,699 INFO L241 Difference]: Finished difference. Result has 85 places, 106 transitions, 1126 flow [2021-03-26 00:16:10,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1126, PETRI_PLACES=85, PETRI_TRANSITIONS=106} [2021-03-26 00:16:10,700 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 24 predicate places. [2021-03-26 00:16:10,700 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:10,700 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 106 transitions, 1126 flow [2021-03-26 00:16:10,700 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 106 transitions, 1126 flow [2021-03-26 00:16:10,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 106 transitions, 1126 flow [2021-03-26 00:16:11,119 INFO L129 PetriNetUnfolder]: 2349/5128 cut-off events. [2021-03-26 00:16:11,120 INFO L130 PetriNetUnfolder]: For 18080/19901 co-relation queries the response was YES. [2021-03-26 00:16:11,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20539 conditions, 5128 events. 2349/5128 cut-off events. For 18080/19901 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 46793 event pairs, 301 based on Foata normal form. 454/5269 useless extension candidates. Maximal degree in co-relation 20504. Up to 1625 conditions per place. [2021-03-26 00:16:11,171 INFO L142 LiptonReduction]: Number of co-enabled transitions 1620 [2021-03-26 00:16:11,386 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:16:11,386 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:11,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 686 [2021-03-26 00:16:11,387 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 106 transitions, 1126 flow [2021-03-26 00:16:11,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:11,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:11,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:11,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:16:11,387 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 116350655, now seen corresponding path program 2 times [2021-03-26 00:16:11,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:11,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429388730] [2021-03-26 00:16:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:11,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:11,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:11,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:11,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:11,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:11,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:11,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:11,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:11,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429388730] [2021-03-26 00:16:11,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:11,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:16:11,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422433023] [2021-03-26 00:16:11,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:16:11,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:16:11,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:16:11,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 222 [2021-03-26 00:16:11,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 106 transitions, 1126 flow. Second operand has 6 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:11,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:11,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 222 [2021-03-26 00:16:11,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:12,009 INFO L129 PetriNetUnfolder]: 2368/5154 cut-off events. [2021-03-26 00:16:12,010 INFO L130 PetriNetUnfolder]: For 22581/27724 co-relation queries the response was YES. [2021-03-26 00:16:12,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23429 conditions, 5154 events. 2368/5154 cut-off events. For 22581/27724 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 46932 event pairs, 298 based on Foata normal form. 1919/6729 useless extension candidates. Maximal degree in co-relation 23392. Up to 1628 conditions per place. [2021-03-26 00:16:12,042 INFO L132 encePairwiseOnDemand]: 215/222 looper letters, 2 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2021-03-26 00:16:12,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 105 transitions, 1128 flow [2021-03-26 00:16:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:16:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:16:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions. [2021-03-26 00:16:12,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581081081081081 [2021-03-26 00:16:12,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1143 transitions. [2021-03-26 00:16:12,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1143 transitions. [2021-03-26 00:16:12,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:12,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1143 transitions. [2021-03-26 00:16:12,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:12,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:12,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:12,048 INFO L185 Difference]: Start difference. First operand has 85 places, 106 transitions, 1126 flow. Second operand 6 states and 1143 transitions. [2021-03-26 00:16:12,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 105 transitions, 1128 flow [2021-03-26 00:16:12,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 105 transitions, 1084 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-26 00:16:12,172 INFO L241 Difference]: Finished difference. Result has 87 places, 104 transitions, 1072 flow [2021-03-26 00:16:12,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1072, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2021-03-26 00:16:12,172 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 26 predicate places. [2021-03-26 00:16:12,172 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:12,172 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 104 transitions, 1072 flow [2021-03-26 00:16:12,172 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 104 transitions, 1072 flow [2021-03-26 00:16:12,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 104 transitions, 1072 flow [2021-03-26 00:16:12,626 INFO L129 PetriNetUnfolder]: 2328/5118 cut-off events. [2021-03-26 00:16:12,626 INFO L130 PetriNetUnfolder]: For 17020/18360 co-relation queries the response was YES. [2021-03-26 00:16:12,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22770 conditions, 5118 events. 2328/5118 cut-off events. For 17020/18360 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 47393 event pairs, 296 based on Foata normal form. 48/4898 useless extension candidates. Maximal degree in co-relation 22736. Up to 1629 conditions per place. [2021-03-26 00:16:12,679 INFO L142 LiptonReduction]: Number of co-enabled transitions 1614 [2021-03-26 00:16:12,777 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:16:12,777 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:16:12,778 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 606 [2021-03-26 00:16:12,778 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1072 flow [2021-03-26 00:16:12,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 187.83333333333334) internal successors, (1127), 6 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:12,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:12,779 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:12,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:16:12,779 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1567485247, now seen corresponding path program 1 times [2021-03-26 00:16:12,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:12,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597813394] [2021-03-26 00:16:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:16:12,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:12,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:12,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:12,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:12,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:12,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:12,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:12,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:16:12,830 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:16:12,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:16:12,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:16:12,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:16:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:16:12,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597813394] [2021-03-26 00:16:12,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:16:12,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:16:12,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901330116] [2021-03-26 00:16:12,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:16:12,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:16:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:16:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:16:12,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 222 [2021-03-26 00:16:12,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1072 flow. Second operand has 7 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:12,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:16:12,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 222 [2021-03-26 00:16:12,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:16:13,355 INFO L129 PetriNetUnfolder]: 2206/4858 cut-off events. [2021-03-26 00:16:13,356 INFO L130 PetriNetUnfolder]: For 20233/24122 co-relation queries the response was YES. [2021-03-26 00:16:13,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24169 conditions, 4858 events. 2206/4858 cut-off events. For 20233/24122 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 44695 event pairs, 259 based on Foata normal form. 1182/5712 useless extension candidates. Maximal degree in co-relation 24133. Up to 1571 conditions per place. [2021-03-26 00:16:13,378 INFO L132 encePairwiseOnDemand]: 215/222 looper letters, 2 selfloop transitions, 18 changer transitions 43/109 dead transitions. [2021-03-26 00:16:13,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 1178 flow [2021-03-26 00:16:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:16:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:16:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1474 transitions. [2021-03-26 00:16:13,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.829954954954955 [2021-03-26 00:16:13,381 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1474 transitions. [2021-03-26 00:16:13,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1474 transitions. [2021-03-26 00:16:13,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:16:13,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1474 transitions. [2021-03-26 00:16:13,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 184.25) internal successors, (1474), 8 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:13,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:13,386 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:13,386 INFO L185 Difference]: Start difference. First operand has 87 places, 104 transitions, 1072 flow. Second operand 8 states and 1474 transitions. [2021-03-26 00:16:13,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 1178 flow [2021-03-26 00:16:13,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 109 transitions, 1112 flow, removed 13 selfloop flow, removed 5 redundant places. [2021-03-26 00:16:13,503 INFO L241 Difference]: Finished difference. Result has 92 places, 66 transitions, 616 flow [2021-03-26 00:16:13,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=616, PETRI_PLACES=92, PETRI_TRANSITIONS=66} [2021-03-26 00:16:13,503 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 31 predicate places. [2021-03-26 00:16:13,503 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:16:13,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 66 transitions, 616 flow [2021-03-26 00:16:13,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 66 transitions, 616 flow [2021-03-26 00:16:13,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 66 transitions, 616 flow [2021-03-26 00:16:13,609 INFO L129 PetriNetUnfolder]: 603/1473 cut-off events. [2021-03-26 00:16:13,610 INFO L130 PetriNetUnfolder]: For 4429/4914 co-relation queries the response was YES. [2021-03-26 00:16:13,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 1473 events. 603/1473 cut-off events. For 4429/4914 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11317 event pairs, 128 based on Foata normal form. 4/1370 useless extension candidates. Maximal degree in co-relation 6514. Up to 506 conditions per place. [2021-03-26 00:16:13,622 INFO L142 LiptonReduction]: Number of co-enabled transitions 798 [2021-03-26 00:16:13,901 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:14,014 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:16:14,463 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:16:14,602 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 00:16:14,700 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 00:16:14,700 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:16:14,700 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1197 [2021-03-26 00:16:14,701 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 600 flow [2021-03-26 00:16:14,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:16:14,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:14,701 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-26 00:16:14,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:16:14,702 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -925069075, now seen corresponding path program 1 times [2021-03-26 00:16:14,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:14,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866048490] [2021-03-26 00:16:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:14,729 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:14,773 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:14,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:16:14,807 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:16:14,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:16:14,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:16:14 BasicIcfg [2021-03-26 00:16:14,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:16:14,896 INFO L168 Benchmark]: Toolchain (without parser) took 19698.31 ms. Allocated memory was 255.9 MB in the beginning and 926.9 MB in the end (delta: 671.1 MB). Free memory was 234.3 MB in the beginning and 364.8 MB in the end (delta: -130.5 MB). Peak memory consumption was 539.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:14,896 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:16:14,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.66 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.3 MB in the beginning and 319.5 MB in the end (delta: -85.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:14,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 360.7 MB. Free memory was 319.5 MB in the beginning and 316.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:14,896 INFO L168 Benchmark]: Boogie Preprocessor took 19.86 ms. Allocated memory is still 360.7 MB. Free memory was 316.8 MB in the beginning and 314.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:14,896 INFO L168 Benchmark]: RCFGBuilder took 1763.59 ms. Allocated memory is still 360.7 MB. Free memory was 314.0 MB in the beginning and 278.6 MB in the end (delta: 35.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:14,897 INFO L168 Benchmark]: TraceAbstraction took 17403.68 ms. Allocated memory was 360.7 MB in the beginning and 926.9 MB in the end (delta: 566.2 MB). Free memory was 277.5 MB in the beginning and 364.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 477.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:14,897 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.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 450.66 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.3 MB in the beginning and 319.5 MB in the end (delta: -85.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 360.7 MB. Free memory was 319.5 MB in the beginning and 316.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.86 ms. Allocated memory is still 360.7 MB. Free memory was 316.8 MB in the beginning and 314.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1763.59 ms. Allocated memory is still 360.7 MB. Free memory was 314.0 MB in the beginning and 278.6 MB in the end (delta: 35.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17403.68 ms. Allocated memory was 360.7 MB in the beginning and 926.9 MB in the end (delta: 566.2 MB). Free memory was 277.5 MB in the beginning and 364.8 MB in the end (delta: -87.3 MB). Peak memory consumption was 477.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2772.3ms, 128 PlacesBefore, 61 PlacesAfterwards, 117 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 5389 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2865, positive: 2751, positive conditional: 2751, positive unconditional: 0, negative: 114, negative conditional: 114, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1989, positive: 1938, positive conditional: 0, positive unconditional: 1938, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1989, positive: 1938, positive conditional: 0, positive unconditional: 1938, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1989, positive: 1933, positive conditional: 0, positive unconditional: 1933, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 445, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 433, negative conditional: 0, negative unconditional: 433, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2865, positive: 813, positive conditional: 813, positive unconditional: 0, negative: 63, negative conditional: 63, negative unconditional: 0, unknown: 1989, unknown conditional: 1989, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1475.5ms, 57 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 32 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2683 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 903, positive: 778, positive conditional: 778, positive unconditional: 0, negative: 125, negative conditional: 125, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, positive: 167, positive conditional: 19, positive unconditional: 148, negative: 39, negative conditional: 10, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 206, positive: 167, positive conditional: 19, positive unconditional: 148, negative: 39, negative conditional: 10, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 206, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 39, negative conditional: 10, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 453, negative conditional: 182, negative unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 903, positive: 611, positive conditional: 611, positive unconditional: 0, negative: 86, negative conditional: 86, negative unconditional: 0, unknown: 206, unknown conditional: 206, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 231, Positive conditional cache size: 231, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1385.0ms, 46 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 563, positive: 484, positive conditional: 484, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, positive: 43, positive conditional: 17, positive unconditional: 26, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 174, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 563, positive: 441, positive conditional: 441, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 57, unknown conditional: 57, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 211, Positive conditional cache size: 211, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.3ms, 44 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 422 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 25, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 25, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 259, Positive conditional cache size: 259, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.9ms, 48 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 57, positive conditional: 18, positive unconditional: 39, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, positive: 57, positive conditional: 18, positive unconditional: 39, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 316, Positive conditional cache size: 316, Positive unconditional cache size: 0, Negative cache size: 63, Negative conditional cache size: 63, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8ms, 51 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 613 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 62, positive conditional: 61, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 62, positive conditional: 61, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 378, Positive conditional cache size: 378, Positive unconditional cache size: 0, Negative cache size: 63, Negative conditional cache size: 63, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 656.9ms, 59 PlacesBefore, 59 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 894 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 34, positive conditional: 20, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 34, positive conditional: 20, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 329, Positive conditional cache size: 329, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1255.0ms, 68 PlacesBefore, 68 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 29, positive conditional: 21, positive unconditional: 8, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 29, positive conditional: 21, positive unconditional: 8, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 356, Positive conditional cache size: 356, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1098.2ms, 74 PlacesBefore, 74 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 447 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 191, positive: 183, positive conditional: 183, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 37, positive conditional: 34, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 37, positive conditional: 34, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, positive: 146, positive conditional: 146, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 302, Positive conditional cache size: 302, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 534.1ms, 79 PlacesBefore, 79 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 302, Positive conditional cache size: 302, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 686.0ms, 85 PlacesBefore, 85 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 1620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 302, Positive conditional cache size: 302, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 605.1ms, 87 PlacesBefore, 87 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1614 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 302, Positive conditional cache size: 302, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1196.2ms, 92 PlacesBefore, 83 PlacesAfterwards, 66 TransitionsBefore, 63 TransitionsAfterwards, 798 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 26, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 26, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 265, Positive conditional cache size: 265, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t953; [L874] FCALL, FORK 0 pthread_create(&t953, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t954; [L876] FCALL, FORK 0 pthread_create(&t954, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t955; [L878] FCALL, FORK 0 pthread_create(&t955, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t956; [L880] FCALL, FORK 0 pthread_create(&t956, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17198.8ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4121.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2854.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 120 SDtfs, 92 SDslu, 84 SDs, 0 SdLazy, 465 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 376.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 273.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1126occurred in iteration=10, InterpolantAutomatonStates: 72, 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: 35.7ms SsaConstructionTime, 370.1ms SatisfiabilityAnalysisTime, 604.5ms InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...