/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/mix004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 23:58:07,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 23:58:07,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 23:58:07,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 23:58:07,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 23:58:07,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 23:58:07,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 23:58:07,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 23:58:07,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 23:58:07,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 23:58:07,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 23:58:07,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 23:58:07,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 23:58:07,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 23:58:07,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 23:58:07,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 23:58:07,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 23:58:07,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 23:58:07,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 23:58:07,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 23:58:07,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 23:58:07,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 23:58:07,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 23:58:07,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 23:58:07,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 23:58:07,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 23:58:07,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 23:58:07,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 23:58:07,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 23:58:07,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 23:58:07,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 23:58:07,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 23:58:07,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 23:58:07,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 23:58:07,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 23:58:07,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 23:58:07,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 23:58:07,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 23:58:07,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 23:58:07,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 23:58:07,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 23:58:07,956 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-25 23:58:07,989 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 23:58:07,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 23:58:07,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 23:58:07,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 23:58:07,993 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 23:58:07,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 23:58:07,994 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 23:58:07,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 23:58:07,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 23:58:07,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 23:58:07,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 23:58:07,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 23:58:07,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 23:58:07,995 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 23:58:07,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 23:58:07,996 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 23:58:07,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 23:58:07,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 23:58:07,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 23:58:07,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 23:58:07,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 23:58:07,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 23:58:07,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 23:58:07,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 23:58:07,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 23:58:07,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 23:58:07,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 23:58:07,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-25 23:58:07,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 23:58:07,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 23:58:07,998 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 23:58:08,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 23:58:08,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 23:58:08,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 23:58:08,327 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 23:58:08,328 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 23:58:08,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004_power.oepc.i [2021-03-25 23:58:08,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714754ed3/c560f44172004680aee4320db4658923/FLAG7a4c0df0d [2021-03-25 23:58:08,907 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 23:58:08,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004_power.oepc.i [2021-03-25 23:58:08,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714754ed3/c560f44172004680aee4320db4658923/FLAG7a4c0df0d [2021-03-25 23:58:09,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714754ed3/c560f44172004680aee4320db4658923 [2021-03-25 23:58:09,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 23:58:09,409 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 23:58:09,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 23:58:09,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 23:58:09,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 23:58:09,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107db9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09, skipping insertion in model container [2021-03-25 23:58:09,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 23:58:09,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 23:58:09,603 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/mix004_power.oepc.i[951,964] [2021-03-25 23:58:09,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 23:58:09,838 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 23:58:09,847 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/mix004_power.oepc.i[951,964] [2021-03-25 23:58:09,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 23:58:09,938 INFO L208 MainTranslator]: Completed translation [2021-03-25 23:58:09,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09 WrapperNode [2021-03-25 23:58:09,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 23:58:09,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 23:58:09,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 23:58:09,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 23:58:09,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 23:58:09,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 23:58:09,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 23:58:09,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 23:58:09,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:09,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:10,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:10,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:10,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... [2021-03-25 23:58:10,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 23:58:10,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 23:58:10,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 23:58:10,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 23:58:10,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 23:58:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 23:58:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 23:58:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 23:58:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 23:58:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 23:58:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 23:58:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 23:58:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 23:58:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 23:58:10,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 23:58:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 23:58:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 23:58:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 23:58:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 23:58:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 23:58:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 23:58:10,085 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 23:58:12,059 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 23:58:12,059 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 23:58:12,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 11:58:12 BoogieIcfgContainer [2021-03-25 23:58:12,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 23:58:12,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 23:58:12,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 23:58:12,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 23:58:12,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 11:58:09" (1/3) ... [2021-03-25 23:58:12,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@850e26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 11:58:12, skipping insertion in model container [2021-03-25 23:58:12,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:58:09" (2/3) ... [2021-03-25 23:58:12,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@850e26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 11:58:12, skipping insertion in model container [2021-03-25 23:58:12,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 11:58:12" (3/3) ... [2021-03-25 23:58:12,068 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004_power.oepc.i [2021-03-25 23:58:12,076 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 23:58:12,080 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 23:58:12,081 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 23:58:12,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,133 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,137 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,137 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,137 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,137 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,142 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,143 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,170 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,192 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,192 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:58:12,196 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 23:58:12,212 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 23:58:12,240 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 23:58:12,240 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 23:58:12,240 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 23:58:12,240 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 23:58:12,240 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 23:58:12,240 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 23:58:12,240 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 23:58:12,241 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 23:58:12,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-25 23:58:12,292 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-25 23:58:12,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:58:12,296 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 93 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-25 23:58:12,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-25 23:58:12,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-25 23:58:12,302 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:12,311 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-25 23:58:12,314 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-25 23:58:12,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-25 23:58:12,335 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-25 23:58:12,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:58:12,336 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 95 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-25 23:58:12,339 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-25 23:58:13,833 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 23:58:14,277 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 23:58:14,409 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 23:58:16,021 INFO L154 LiptonReduction]: Checked pairs total: 5692 [2021-03-25 23:58:16,021 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 23:58:16,025 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3724 [2021-03-25 23:58:16,038 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 23:58:16,038 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:58:16,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:16,039 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:16,039 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-25 23:58:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -554722086, now seen corresponding path program 1 times [2021-03-25 23:58:16,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:16,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699627136] [2021-03-25 23:58:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:16,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:16,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:16,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:16,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:16,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699627136] [2021-03-25 23:58:16,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:16,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:58:16,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412572247] [2021-03-25 23:58:16,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 23:58:16,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 23:58:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 23:58:16,316 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-25 23:58:16,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:16,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:16,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-25 23:58:16,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:16,470 INFO L129 PetriNetUnfolder]: 133/342 cut-off events. [2021-03-25 23:58:16,470 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:58:16,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 342 events. 133/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1825 event pairs, 110 based on Foata normal form. 33/355 useless extension candidates. Maximal degree in co-relation 538. Up to 153 conditions per place. [2021-03-25 23:58:16,477 INFO L132 encePairwiseOnDemand]: 194/198 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 23:58:16,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-25 23:58:16,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:58:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:58:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-25 23:58:16,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158249158249159 [2021-03-25 23:58:16,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-25 23:58:16,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-25 23:58:16,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:16,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-25 23:58:16,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:16,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:16,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:16,521 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 544 transitions. [2021-03-25 23:58:16,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-25 23:58:16,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 23:58:16,525 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-25 23:58:16,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-25 23:58:16,527 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 23:58:16,527 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:16,527 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 23:58:16,528 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 23:58:16,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-25 23:58:16,534 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-25 23:58:16,534 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:58:16,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 23:58:16,537 INFO L142 LiptonReduction]: Number of co-enabled transitions 666 [2021-03-25 23:58:18,238 INFO L154 LiptonReduction]: Checked pairs total: 2958 [2021-03-25 23:58:18,238 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 23:58:18,239 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1712 [2021-03-25 23:58:18,240 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2021-03-25 23:58:18,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:18,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:18,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:18,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 23:58:18,241 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-25 23:58:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1604568869, now seen corresponding path program 1 times [2021-03-25 23:58:18,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:18,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101269005] [2021-03-25 23:58:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:18,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:18,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:18,355 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:58:18,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:58:18,366 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 23:58:18,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:58:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:18,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101269005] [2021-03-25 23:58:18,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:18,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:58:18,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328002106] [2021-03-25 23:58:18,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:58:18,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:18,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:58:18,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:58:18,380 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 212 [2021-03-25 23:58:18,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:18,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:18,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 212 [2021-03-25 23:58:18,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:18,487 INFO L129 PetriNetUnfolder]: 258/536 cut-off events. [2021-03-25 23:58:18,487 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:58:18,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 536 events. 258/536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3018 event pairs, 83 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 938. Up to 200 conditions per place. [2021-03-25 23:58:18,490 INFO L132 encePairwiseOnDemand]: 203/212 looper letters, 7 selfloop transitions, 5 changer transitions 14/50 dead transitions. [2021-03-25 23:58:18,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 164 flow [2021-03-25 23:58:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 23:58:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 23:58:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-25 23:58:18,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8462264150943396 [2021-03-25 23:58:18,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-25 23:58:18,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-25 23:58:18,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:18,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-25 23:58:18,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:18,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:18,499 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:18,499 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 5 states and 897 transitions. [2021-03-25 23:58:18,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 164 flow [2021-03-25 23:58:18,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:58:18,501 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 117 flow [2021-03-25 23:58:18,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-25 23:58:18,501 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -14 predicate places. [2021-03-25 23:58:18,501 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:18,502 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 117 flow [2021-03-25 23:58:18,502 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 117 flow [2021-03-25 23:58:18,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 117 flow [2021-03-25 23:58:18,530 INFO L129 PetriNetUnfolder]: 115/294 cut-off events. [2021-03-25 23:58:18,530 INFO L130 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2021-03-25 23:58:18,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 294 events. 115/294 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1547 event pairs, 79 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 612. Up to 165 conditions per place. [2021-03-25 23:58:18,534 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-25 23:58:19,380 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-25 23:58:19,567 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 23:58:19,906 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-25 23:58:20,076 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 23:58:20,102 INFO L154 LiptonReduction]: Checked pairs total: 966 [2021-03-25 23:58:20,102 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 23:58:20,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1602 [2021-03-25 23:58:20,104 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 113 flow [2021-03-25 23:58:20,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:20,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:20,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 23:58:20,105 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-25 23:58:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash 148256223, now seen corresponding path program 1 times [2021-03-25 23:58:20,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:20,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053523455] [2021-03-25 23:58:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:20,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:20,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:20,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053523455] [2021-03-25 23:58:20,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:20,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 23:58:20,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983771818] [2021-03-25 23:58:20,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 23:58:20,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:20,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 23:58:20,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 23:58:20,205 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 214 [2021-03-25 23:58:20,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:20,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 214 [2021-03-25 23:58:20,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:20,237 INFO L129 PetriNetUnfolder]: 89/231 cut-off events. [2021-03-25 23:58:20,237 INFO L130 PetriNetUnfolder]: For 113/124 co-relation queries the response was YES. [2021-03-25 23:58:20,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 231 events. 89/231 cut-off events. For 113/124 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1105 event pairs, 33 based on Foata normal form. 2/208 useless extension candidates. Maximal degree in co-relation 508. Up to 135 conditions per place. [2021-03-25 23:58:20,239 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 1 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2021-03-25 23:58:20,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 121 flow [2021-03-25 23:58:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:58:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:58:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-03-25 23:58:20,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8987538940809969 [2021-03-25 23:58:20,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-03-25 23:58:20,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-03-25 23:58:20,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:20,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-03-25 23:58:20,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,244 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 113 flow. Second operand 3 states and 577 transitions. [2021-03-25 23:58:20,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 121 flow [2021-03-25 23:58:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 23:58:20,247 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 119 flow [2021-03-25 23:58:20,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-03-25 23:58:20,247 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -17 predicate places. [2021-03-25 23:58:20,247 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:20,248 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 119 flow [2021-03-25 23:58:20,248 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 119 flow [2021-03-25 23:58:20,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 119 flow [2021-03-25 23:58:20,293 INFO L129 PetriNetUnfolder]: 86/259 cut-off events. [2021-03-25 23:58:20,293 INFO L130 PetriNetUnfolder]: For 94/104 co-relation queries the response was YES. [2021-03-25 23:58:20,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 259 events. 86/259 cut-off events. For 94/104 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1423 event pairs, 71 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 529. Up to 133 conditions per place. [2021-03-25 23:58:20,296 INFO L142 LiptonReduction]: Number of co-enabled transitions 518 [2021-03-25 23:58:20,403 INFO L154 LiptonReduction]: Checked pairs total: 355 [2021-03-25 23:58:20,403 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:58:20,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 156 [2021-03-25 23:58:20,404 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 119 flow [2021-03-25 23:58:20,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:20,405 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:20,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 23:58:20,405 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-25 23:58:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash -372332131, now seen corresponding path program 1 times [2021-03-25 23:58:20,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:20,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695347065] [2021-03-25 23:58:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:20,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:20,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:20,469 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:58:20,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:58:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:20,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695347065] [2021-03-25 23:58:20,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:20,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:58:20,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895868682] [2021-03-25 23:58:20,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:58:20,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:58:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:58:20,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 214 [2021-03-25 23:58:20,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 119 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-25 23:58:20,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:20,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 214 [2021-03-25 23:58:20,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:20,527 INFO L129 PetriNetUnfolder]: 81/195 cut-off events. [2021-03-25 23:58:20,527 INFO L130 PetriNetUnfolder]: For 175/269 co-relation queries the response was YES. [2021-03-25 23:58:20,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 195 events. 81/195 cut-off events. For 175/269 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 856 event pairs, 26 based on Foata normal form. 10/201 useless extension candidates. Maximal degree in co-relation 575. Up to 113 conditions per place. [2021-03-25 23:58:20,529 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 13 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 23:58:20,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 176 flow [2021-03-25 23:58:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:58:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:58:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-25 23:58:20,531 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8520249221183801 [2021-03-25 23:58:20,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-25 23:58:20,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-25 23:58:20,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:20,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-25 23:58:20,533 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-25 23:58:20,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,535 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 119 flow. Second operand 3 states and 547 transitions. [2021-03-25 23:58:20,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 176 flow [2021-03-25 23:58:20,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:58:20,537 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 124 flow [2021-03-25 23:58:20,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-25 23:58:20,537 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2021-03-25 23:58:20,538 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:20,538 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 124 flow [2021-03-25 23:58:20,538 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 124 flow [2021-03-25 23:58:20,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 124 flow [2021-03-25 23:58:20,557 INFO L129 PetriNetUnfolder]: 67/196 cut-off events. [2021-03-25 23:58:20,557 INFO L130 PetriNetUnfolder]: For 85/97 co-relation queries the response was YES. [2021-03-25 23:58:20,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 196 events. 67/196 cut-off events. For 85/97 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 930 event pairs, 33 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 440. Up to 106 conditions per place. [2021-03-25 23:58:20,559 INFO L142 LiptonReduction]: Number of co-enabled transitions 516 [2021-03-25 23:58:20,596 INFO L154 LiptonReduction]: Checked pairs total: 324 [2021-03-25 23:58:20,596 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:58:20,597 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-25 23:58:20,599 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 124 flow [2021-03-25 23:58:20,600 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-25 23:58:20,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:20,600 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:20,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 23:58:20,600 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-25 23:58:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash 99110752, now seen corresponding path program 1 times [2021-03-25 23:58:20,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:20,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881893557] [2021-03-25 23:58:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:20,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:20,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:20,679 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 23:58:20,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 23:58:20,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:20,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:20,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881893557] [2021-03-25 23:58:20,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:20,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:58:20,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907874897] [2021-03-25 23:58:20,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:58:20,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:58:20,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:58:20,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 214 [2021-03-25 23:58:20,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:20,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 214 [2021-03-25 23:58:20,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:20,818 INFO L129 PetriNetUnfolder]: 470/917 cut-off events. [2021-03-25 23:58:20,818 INFO L130 PetriNetUnfolder]: For 204/219 co-relation queries the response was YES. [2021-03-25 23:58:20,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2007 conditions, 917 events. 470/917 cut-off events. For 204/219 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6130 event pairs, 208 based on Foata normal form. 65/797 useless extension candidates. Maximal degree in co-relation 1993. Up to 598 conditions per place. [2021-03-25 23:58:20,827 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 12 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2021-03-25 23:58:20,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 196 flow [2021-03-25 23:58:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 23:58:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 23:58:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2021-03-25 23:58:20,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8448598130841122 [2021-03-25 23:58:20,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2021-03-25 23:58:20,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2021-03-25 23:58:20,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:20,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2021-03-25 23:58:20,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,835 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 124 flow. Second operand 5 states and 904 transitions. [2021-03-25 23:58:20,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 196 flow [2021-03-25 23:58:20,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:58:20,838 INFO L241 Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow [2021-03-25 23:58:20,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2021-03-25 23:58:20,839 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2021-03-25 23:58:20,839 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:20,839 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 193 flow [2021-03-25 23:58:20,839 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 193 flow [2021-03-25 23:58:20,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 193 flow [2021-03-25 23:58:20,895 INFO L129 PetriNetUnfolder]: 321/691 cut-off events. [2021-03-25 23:58:20,895 INFO L130 PetriNetUnfolder]: For 498/698 co-relation queries the response was YES. [2021-03-25 23:58:20,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 691 events. 321/691 cut-off events. For 498/698 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 4593 event pairs, 146 based on Foata normal form. 8/629 useless extension candidates. Maximal degree in co-relation 1951. Up to 409 conditions per place. [2021-03-25 23:58:20,905 INFO L142 LiptonReduction]: Number of co-enabled transitions 704 [2021-03-25 23:58:20,985 INFO L154 LiptonReduction]: Checked pairs total: 804 [2021-03-25 23:58:20,986 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:58:20,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-03-25 23:58:20,988 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 187 flow [2021-03-25 23:58:20,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:20,989 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:20,989 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:20,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 23:58:20,989 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-25 23:58:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash -781375067, now seen corresponding path program 1 times [2021-03-25 23:58:20,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:20,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735073089] [2021-03-25 23:58:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:21,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:21,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:21,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:21,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:21,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:21,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:21,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735073089] [2021-03-25 23:58:21,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:21,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:58:21,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001593620] [2021-03-25 23:58:21,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:58:21,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:58:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:58:21,064 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 214 [2021-03-25 23:58:21,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:21,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 214 [2021-03-25 23:58:21,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:21,180 INFO L129 PetriNetUnfolder]: 476/958 cut-off events. [2021-03-25 23:58:21,180 INFO L130 PetriNetUnfolder]: For 1058/1329 co-relation queries the response was YES. [2021-03-25 23:58:21,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 958 events. 476/958 cut-off events. For 1058/1329 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6467 event pairs, 226 based on Foata normal form. 46/898 useless extension candidates. Maximal degree in co-relation 2755. Up to 565 conditions per place. [2021-03-25 23:58:21,190 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 6 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2021-03-25 23:58:21,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 190 flow [2021-03-25 23:58:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:58:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:58:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 736 transitions. [2021-03-25 23:58:21,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2021-03-25 23:58:21,192 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 736 transitions. [2021-03-25 23:58:21,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 736 transitions. [2021-03-25 23:58:21,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:21,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 736 transitions. [2021-03-25 23:58:21,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,196 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,196 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 187 flow. Second operand 4 states and 736 transitions. [2021-03-25 23:58:21,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 190 flow [2021-03-25 23:58:21,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 183 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 23:58:21,202 INFO L241 Difference]: Finished difference. Result has 52 places, 39 transitions, 171 flow [2021-03-25 23:58:21,203 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2021-03-25 23:58:21,203 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2021-03-25 23:58:21,203 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:21,203 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 39 transitions, 171 flow [2021-03-25 23:58:21,203 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 39 transitions, 171 flow [2021-03-25 23:58:21,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 39 transitions, 171 flow [2021-03-25 23:58:21,293 INFO L129 PetriNetUnfolder]: 439/900 cut-off events. [2021-03-25 23:58:21,294 INFO L130 PetriNetUnfolder]: For 808/973 co-relation queries the response was YES. [2021-03-25 23:58:21,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2508 conditions, 900 events. 439/900 cut-off events. For 808/973 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6137 event pairs, 222 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 2492. Up to 522 conditions per place. [2021-03-25 23:58:21,306 INFO L142 LiptonReduction]: Number of co-enabled transitions 602 [2021-03-25 23:58:21,453 INFO L154 LiptonReduction]: Checked pairs total: 486 [2021-03-25 23:58:21,454 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:58:21,454 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 251 [2021-03-25 23:58:21,455 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 174 flow [2021-03-25 23:58:21,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:21,456 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:21,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 23:58:21,485 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-25 23:58:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:21,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2064823437, now seen corresponding path program 2 times [2021-03-25 23:58:21,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:21,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934294336] [2021-03-25 23:58:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:21,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:21,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:21,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:21,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:21,558 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 23:58:21,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 23:58:21,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:21,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:21,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934294336] [2021-03-25 23:58:21,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:21,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:58:21,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330552829] [2021-03-25 23:58:21,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:58:21,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:21,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:58:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:58:21,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 215 [2021-03-25 23:58:21,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:21,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 215 [2021-03-25 23:58:21,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:21,748 INFO L129 PetriNetUnfolder]: 503/1036 cut-off events. [2021-03-25 23:58:21,748 INFO L130 PetriNetUnfolder]: For 920/1977 co-relation queries the response was YES. [2021-03-25 23:58:21,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1036 events. 503/1036 cut-off events. For 920/1977 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 6910 event pairs, 88 based on Foata normal form. 168/1106 useless extension candidates. Maximal degree in co-relation 3495. Up to 674 conditions per place. [2021-03-25 23:58:21,760 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 13 selfloop transitions, 14 changer transitions 0/54 dead transitions. [2021-03-25 23:58:21,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 308 flow [2021-03-25 23:58:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:58:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:58:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1091 transitions. [2021-03-25 23:58:21,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8457364341085272 [2021-03-25 23:58:21,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1091 transitions. [2021-03-25 23:58:21,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1091 transitions. [2021-03-25 23:58:21,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:21,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1091 transitions. [2021-03-25 23:58:21,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,768 INFO L185 Difference]: Start difference. First operand has 52 places, 39 transitions, 174 flow. Second operand 6 states and 1091 transitions. [2021-03-25 23:58:21,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 308 flow [2021-03-25 23:58:21,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 23:58:21,774 INFO L241 Difference]: Finished difference. Result has 59 places, 48 transitions, 292 flow [2021-03-25 23:58:21,774 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2021-03-25 23:58:21,774 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2021-03-25 23:58:21,774 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:21,775 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 292 flow [2021-03-25 23:58:21,775 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 292 flow [2021-03-25 23:58:21,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 292 flow [2021-03-25 23:58:21,860 INFO L129 PetriNetUnfolder]: 340/799 cut-off events. [2021-03-25 23:58:21,860 INFO L130 PetriNetUnfolder]: For 1627/2089 co-relation queries the response was YES. [2021-03-25 23:58:21,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 799 events. 340/799 cut-off events. For 1627/2089 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5555 event pairs, 105 based on Foata normal form. 22/786 useless extension candidates. Maximal degree in co-relation 3223. Up to 521 conditions per place. [2021-03-25 23:58:21,874 INFO L142 LiptonReduction]: Number of co-enabled transitions 824 [2021-03-25 23:58:21,977 INFO L154 LiptonReduction]: Checked pairs total: 596 [2021-03-25 23:58:21,977 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:58:21,977 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 203 [2021-03-25 23:58:21,978 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 284 flow [2021-03-25 23:58:21,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:21,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:21,978 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-25 23:58:21,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 23:58:21,979 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-25 23:58:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1556520593, now seen corresponding path program 1 times [2021-03-25 23:58:21,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:21,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348658407] [2021-03-25 23:58:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:22,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:22,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:22,110 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 23:58:22,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 23:58:22,127 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 23:58:22,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 23:58:22,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:22,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:22,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348658407] [2021-03-25 23:58:22,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:22,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:58:22,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018946419] [2021-03-25 23:58:22,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:58:22,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:58:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:58:22,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 215 [2021-03-25 23:58:22,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:22,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:22,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 215 [2021-03-25 23:58:22,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:22,736 INFO L129 PetriNetUnfolder]: 1531/3048 cut-off events. [2021-03-25 23:58:22,736 INFO L130 PetriNetUnfolder]: For 6543/7702 co-relation queries the response was YES. [2021-03-25 23:58:22,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11328 conditions, 3048 events. 1531/3048 cut-off events. For 6543/7702 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 23240 event pairs, 446 based on Foata normal form. 120/2972 useless extension candidates. Maximal degree in co-relation 11306. Up to 1361 conditions per place. [2021-03-25 23:58:22,767 INFO L132 encePairwiseOnDemand]: 207/215 looper letters, 14 selfloop transitions, 16 changer transitions 0/64 dead transitions. [2021-03-25 23:58:22,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 390 flow [2021-03-25 23:58:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:58:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:58:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1040 transitions. [2021-03-25 23:58:22,770 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8062015503875969 [2021-03-25 23:58:22,770 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1040 transitions. [2021-03-25 23:58:22,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1040 transitions. [2021-03-25 23:58:22,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:22,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1040 transitions. [2021-03-25 23:58:22,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.33333333333334) internal successors, (1040), 6 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:22,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:22,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:22,776 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 284 flow. Second operand 6 states and 1040 transitions. [2021-03-25 23:58:22,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 390 flow [2021-03-25 23:58:22,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 336 flow, removed 22 selfloop flow, removed 4 redundant places. [2021-03-25 23:58:22,860 INFO L241 Difference]: Finished difference. Result has 61 places, 62 transitions, 328 flow [2021-03-25 23:58:22,860 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2021-03-25 23:58:22,860 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2021-03-25 23:58:22,860 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:22,860 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 328 flow [2021-03-25 23:58:22,861 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 328 flow [2021-03-25 23:58:22,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 328 flow [2021-03-25 23:58:23,181 INFO L129 PetriNetUnfolder]: 1460/3085 cut-off events. [2021-03-25 23:58:23,181 INFO L130 PetriNetUnfolder]: For 3978/4455 co-relation queries the response was YES. [2021-03-25 23:58:23,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9466 conditions, 3085 events. 1460/3085 cut-off events. For 3978/4455 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 25031 event pairs, 465 based on Foata normal form. 104/3019 useless extension candidates. Maximal degree in co-relation 9446. Up to 1304 conditions per place. [2021-03-25 23:58:23,232 INFO L142 LiptonReduction]: Number of co-enabled transitions 1178 [2021-03-25 23:58:24,806 INFO L154 LiptonReduction]: Checked pairs total: 205 [2021-03-25 23:58:24,806 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:58:24,806 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1946 [2021-03-25 23:58:24,807 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 331 flow [2021-03-25 23:58:24,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:24,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:24,807 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-25 23:58:24,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 23:58:24,808 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-25 23:58:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1155320789, now seen corresponding path program 1 times [2021-03-25 23:58:24,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:24,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472808921] [2021-03-25 23:58:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:24,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:24,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:24,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:24,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:24,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:24,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:24,870 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 23:58:24,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:58:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:24,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472808921] [2021-03-25 23:58:24,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:24,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:58:24,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122552373] [2021-03-25 23:58:24,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:58:24,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:58:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:58:24,884 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 216 [2021-03-25 23:58:24,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 171.4) internal successors, (857), 5 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:24,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:24,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 216 [2021-03-25 23:58:24,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:25,554 INFO L129 PetriNetUnfolder]: 2654/5230 cut-off events. [2021-03-25 23:58:25,555 INFO L130 PetriNetUnfolder]: For 8724/10075 co-relation queries the response was YES. [2021-03-25 23:58:25,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16703 conditions, 5230 events. 2654/5230 cut-off events. For 8724/10075 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 44243 event pairs, 514 based on Foata normal form. 229/5046 useless extension candidates. Maximal degree in co-relation 16681. Up to 2278 conditions per place. [2021-03-25 23:58:25,613 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 23 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2021-03-25 23:58:25,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 512 flow [2021-03-25 23:58:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:58:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:58:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1047 transitions. [2021-03-25 23:58:25,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8078703703703703 [2021-03-25 23:58:25,616 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1047 transitions. [2021-03-25 23:58:25,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1047 transitions. [2021-03-25 23:58:25,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:25,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1047 transitions. [2021-03-25 23:58:25,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:25,620 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-25 23:58:25,620 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-25 23:58:25,620 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 331 flow. Second operand 6 states and 1047 transitions. [2021-03-25 23:58:25,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 512 flow [2021-03-25 23:58:25,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 23:58:25,638 INFO L241 Difference]: Finished difference. Result has 68 places, 67 transitions, 390 flow [2021-03-25 23:58:25,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2021-03-25 23:58:25,638 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2021-03-25 23:58:25,638 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:25,638 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 390 flow [2021-03-25 23:58:25,639 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 390 flow [2021-03-25 23:58:25,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 390 flow [2021-03-25 23:58:26,209 INFO L129 PetriNetUnfolder]: 2660/5535 cut-off events. [2021-03-25 23:58:26,209 INFO L130 PetriNetUnfolder]: For 7070/7963 co-relation queries the response was YES. [2021-03-25 23:58:26,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16956 conditions, 5535 events. 2660/5535 cut-off events. For 7070/7963 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 49462 event pairs, 732 based on Foata normal form. 189/5343 useless extension candidates. Maximal degree in co-relation 16932. Up to 2400 conditions per place. [2021-03-25 23:58:26,296 INFO L142 LiptonReduction]: Number of co-enabled transitions 1246 [2021-03-25 23:58:31,978 INFO L154 LiptonReduction]: Checked pairs total: 204 [2021-03-25 23:58:31,978 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:58:31,979 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6341 [2021-03-25 23:58:31,980 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 390 flow [2021-03-25 23:58:31,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.4) internal successors, (857), 5 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:31,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:31,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:31,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 23:58:31,981 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-25 23:58:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1903802657, now seen corresponding path program 1 times [2021-03-25 23:58:31,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:31,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154154250] [2021-03-25 23:58:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:32,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:32,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:32,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:32,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:32,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:32,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154154250] [2021-03-25 23:58:32,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:32,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:58:32,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104652443] [2021-03-25 23:58:32,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:58:32,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:58:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:58:32,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 217 [2021-03-25 23:58:32,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:32,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:32,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 217 [2021-03-25 23:58:32,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:33,008 INFO L129 PetriNetUnfolder]: 4210/8382 cut-off events. [2021-03-25 23:58:33,009 INFO L130 PetriNetUnfolder]: For 12389/13710 co-relation queries the response was YES. [2021-03-25 23:58:33,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25876 conditions, 8382 events. 4210/8382 cut-off events. For 12389/13710 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 77223 event pairs, 1171 based on Foata normal form. 330/8117 useless extension candidates. Maximal degree in co-relation 25850. Up to 3934 conditions per place. [2021-03-25 23:58:33,068 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 6 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2021-03-25 23:58:33,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 451 flow [2021-03-25 23:58:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:58:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:58:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 753 transitions. [2021-03-25 23:58:33,070 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8675115207373272 [2021-03-25 23:58:33,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 753 transitions. [2021-03-25 23:58:33,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 753 transitions. [2021-03-25 23:58:33,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:33,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 753 transitions. [2021-03-25 23:58:33,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.25) internal successors, (753), 4 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:33,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:33,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:33,074 INFO L185 Difference]: Start difference. First operand has 68 places, 67 transitions, 390 flow. Second operand 4 states and 753 transitions. [2021-03-25 23:58:33,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 451 flow [2021-03-25 23:58:33,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 23:58:33,099 INFO L241 Difference]: Finished difference. Result has 72 places, 70 transitions, 428 flow [2021-03-25 23:58:33,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=428, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2021-03-25 23:58:33,099 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2021-03-25 23:58:33,099 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:33,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 428 flow [2021-03-25 23:58:33,100 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 70 transitions, 428 flow [2021-03-25 23:58:33,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 428 flow [2021-03-25 23:58:33,851 INFO L129 PetriNetUnfolder]: 3965/8239 cut-off events. [2021-03-25 23:58:33,852 INFO L130 PetriNetUnfolder]: For 11206/12531 co-relation queries the response was YES. [2021-03-25 23:58:33,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25620 conditions, 8239 events. 3965/8239 cut-off events. For 11206/12531 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 78985 event pairs, 1153 based on Foata normal form. 272/7986 useless extension candidates. Maximal degree in co-relation 25594. Up to 3825 conditions per place. [2021-03-25 23:58:33,961 INFO L142 LiptonReduction]: Number of co-enabled transitions 1286 [2021-03-25 23:58:50,844 INFO L154 LiptonReduction]: Checked pairs total: 94 [2021-03-25 23:58:50,844 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 23:58:50,844 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17745 [2021-03-25 23:58:50,845 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 434 flow [2021-03-25 23:58:50,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:50,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:50,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:50,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 23:58:50,846 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-25 23:58:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1860672036, now seen corresponding path program 1 times [2021-03-25 23:58:50,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:50,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359167442] [2021-03-25 23:58:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:50,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:50,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:50,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:50,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:50,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:50,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:50,913 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 23:58:50,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 23:58:50,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:50,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:50,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359167442] [2021-03-25 23:58:50,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:50,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:58:50,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570927158] [2021-03-25 23:58:50,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 23:58:50,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 23:58:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 23:58:50,923 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 219 [2021-03-25 23:58:50,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:50,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:50,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 219 [2021-03-25 23:58:50,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:51,825 INFO L129 PetriNetUnfolder]: 4929/9589 cut-off events. [2021-03-25 23:58:51,825 INFO L130 PetriNetUnfolder]: For 14461/29740 co-relation queries the response was YES. [2021-03-25 23:58:51,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33514 conditions, 9589 events. 4929/9589 cut-off events. For 14461/29740 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 90325 event pairs, 531 based on Foata normal form. 2813/11079 useless extension candidates. Maximal degree in co-relation 33486. Up to 5008 conditions per place. [2021-03-25 23:58:51,880 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 13 selfloop transitions, 18 changer transitions 5/86 dead transitions. [2021-03-25 23:58:51,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 614 flow [2021-03-25 23:58:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:58:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:58:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1301 transitions. [2021-03-25 23:58:51,883 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486627527723418 [2021-03-25 23:58:51,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1301 transitions. [2021-03-25 23:58:51,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1301 transitions. [2021-03-25 23:58:51,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:51,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1301 transitions. [2021-03-25 23:58:51,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 185.85714285714286) internal successors, (1301), 7 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:51,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:51,889 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:51,889 INFO L185 Difference]: Start difference. First operand has 72 places, 70 transitions, 434 flow. Second operand 7 states and 1301 transitions. [2021-03-25 23:58:51,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 614 flow [2021-03-25 23:58:51,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 86 transitions, 604 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 23:58:51,949 INFO L241 Difference]: Finished difference. Result has 79 places, 78 transitions, 567 flow [2021-03-25 23:58:51,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2021-03-25 23:58:51,949 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2021-03-25 23:58:51,950 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:51,950 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 78 transitions, 567 flow [2021-03-25 23:58:51,950 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 78 transitions, 567 flow [2021-03-25 23:58:51,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 78 transitions, 567 flow [2021-03-25 23:58:52,401 INFO L129 PetriNetUnfolder]: 2537/5942 cut-off events. [2021-03-25 23:58:52,401 INFO L130 PetriNetUnfolder]: For 14057/16393 co-relation queries the response was YES. [2021-03-25 23:58:52,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23817 conditions, 5942 events. 2537/5942 cut-off events. For 14057/16393 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 59585 event pairs, 438 based on Foata normal form. 69/5693 useless extension candidates. Maximal degree in co-relation 23788. Up to 3194 conditions per place. [2021-03-25 23:58:52,473 INFO L142 LiptonReduction]: Number of co-enabled transitions 1430 [2021-03-25 23:58:52,748 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 23:58:52,748 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:58:52,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 798 [2021-03-25 23:58:52,749 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 567 flow [2021-03-25 23:58:52,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:52,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:52,750 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:52,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 23:58:52,750 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-25 23:58:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 762326989, now seen corresponding path program 1 times [2021-03-25 23:58:52,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:52,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775120460] [2021-03-25 23:58:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:52,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:52,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 23:58:52,824 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.6 percent of original size [2021-03-25 23:58:52,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 23:58:52,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:52,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 23:58:52,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:52,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 23:58:52,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:52,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:52,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775120460] [2021-03-25 23:58:52,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:52,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:58:52,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126870713] [2021-03-25 23:58:52,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:58:52,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:58:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:58:52,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 219 [2021-03-25 23:58:52,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 567 flow. Second operand has 7 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:52,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:52,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 219 [2021-03-25 23:58:52,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:53,763 INFO L129 PetriNetUnfolder]: 3924/8711 cut-off events. [2021-03-25 23:58:53,764 INFO L130 PetriNetUnfolder]: For 24813/31828 co-relation queries the response was YES. [2021-03-25 23:58:53,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38274 conditions, 8711 events. 3924/8711 cut-off events. For 24813/31828 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 88794 event pairs, 517 based on Foata normal form. 432/8659 useless extension candidates. Maximal degree in co-relation 38243. Up to 5179 conditions per place. [2021-03-25 23:58:53,819 INFO L132 encePairwiseOnDemand]: 211/219 looper letters, 26 selfloop transitions, 20 changer transitions 8/100 dead transitions. [2021-03-25 23:58:53,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 807 flow [2021-03-25 23:58:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:58:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:58:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1165 transitions. [2021-03-25 23:58:53,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7599478147423353 [2021-03-25 23:58:53,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1165 transitions. [2021-03-25 23:58:53,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1165 transitions. [2021-03-25 23:58:53,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:53,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1165 transitions. [2021-03-25 23:58:53,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.42857142857142) internal successors, (1165), 7 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:53,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:53,828 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:53,828 INFO L185 Difference]: Start difference. First operand has 79 places, 78 transitions, 567 flow. Second operand 7 states and 1165 transitions. [2021-03-25 23:58:53,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 807 flow [2021-03-25 23:58:55,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 742 flow, removed 26 selfloop flow, removed 2 redundant places. [2021-03-25 23:58:55,132 INFO L241 Difference]: Finished difference. Result has 87 places, 83 transitions, 600 flow [2021-03-25 23:58:55,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=600, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2021-03-25 23:58:55,132 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2021-03-25 23:58:55,132 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:55,132 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 600 flow [2021-03-25 23:58:55,132 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 600 flow [2021-03-25 23:58:55,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 600 flow [2021-03-25 23:58:55,787 INFO L129 PetriNetUnfolder]: 3723/8372 cut-off events. [2021-03-25 23:58:55,788 INFO L130 PetriNetUnfolder]: For 15022/15782 co-relation queries the response was YES. [2021-03-25 23:58:55,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28642 conditions, 8372 events. 3723/8372 cut-off events. For 15022/15782 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 87456 event pairs, 484 based on Foata normal form. 99/8048 useless extension candidates. Maximal degree in co-relation 28608. Up to 2426 conditions per place. [2021-03-25 23:58:55,867 INFO L142 LiptonReduction]: Number of co-enabled transitions 1568 [2021-03-25 23:58:56,543 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 23:58:56,543 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:58:56,543 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1411 [2021-03-25 23:58:56,544 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 600 flow [2021-03-25 23:58:56,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:56,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:58:56,545 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:58:56,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 23:58:56,545 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-25 23:58:56,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:58:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash -808915610, now seen corresponding path program 1 times [2021-03-25 23:58:56,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:58:56,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350364449] [2021-03-25 23:58:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:58:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:58:56,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:56,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:56,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:56,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:56,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:56,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:56,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:56,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:58:56,675 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 23:58:56,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 23:58:56,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:58:56,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:58:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:58:56,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350364449] [2021-03-25 23:58:56,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:58:56,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 23:58:56,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343806954] [2021-03-25 23:58:56,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:58:56,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:58:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:58:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:58:56,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 219 [2021-03-25 23:58:56,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 600 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-25 23:58:56,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:58:56,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 219 [2021-03-25 23:58:56,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:58:58,002 INFO L129 PetriNetUnfolder]: 7074/13473 cut-off events. [2021-03-25 23:58:58,002 INFO L130 PetriNetUnfolder]: For 27551/44734 co-relation queries the response was YES. [2021-03-25 23:58:58,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50887 conditions, 13473 events. 7074/13473 cut-off events. For 27551/44734 co-relation queries the response was YES. Maximal size of possible extension queue 1922. Compared 131230 event pairs, 485 based on Foata normal form. 2724/14344 useless extension candidates. Maximal degree in co-relation 50851. Up to 4294 conditions per place. [2021-03-25 23:58:58,078 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 6 selfloop transitions, 23 changer transitions 19/90 dead transitions. [2021-03-25 23:58:58,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 705 flow [2021-03-25 23:58:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 23:58:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 23:58:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1665 transitions. [2021-03-25 23:58:58,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2021-03-25 23:58:58,082 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1665 transitions. [2021-03-25 23:58:58,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1665 transitions. [2021-03-25 23:58:58,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:58:58,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1665 transitions. [2021-03-25 23:58:58,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:58,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:58,090 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:58:58,090 INFO L185 Difference]: Start difference. First operand has 87 places, 83 transitions, 600 flow. Second operand 9 states and 1665 transitions. [2021-03-25 23:58:58,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 90 transitions, 705 flow [2021-03-25 23:58:59,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 90 transitions, 673 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-25 23:58:59,322 INFO L241 Difference]: Finished difference. Result has 95 places, 68 transitions, 502 flow [2021-03-25 23:58:59,322 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=95, PETRI_TRANSITIONS=68} [2021-03-25 23:58:59,322 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2021-03-25 23:58:59,322 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:58:59,323 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 68 transitions, 502 flow [2021-03-25 23:58:59,323 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 68 transitions, 502 flow [2021-03-25 23:58:59,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 68 transitions, 502 flow [2021-03-25 23:58:59,452 INFO L129 PetriNetUnfolder]: 754/1809 cut-off events. [2021-03-25 23:58:59,453 INFO L130 PetriNetUnfolder]: For 4039/4348 co-relation queries the response was YES. [2021-03-25 23:58:59,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7237 conditions, 1809 events. 754/1809 cut-off events. For 4039/4348 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 15232 event pairs, 66 based on Foata normal form. 14/1720 useless extension candidates. Maximal degree in co-relation 7203. Up to 555 conditions per place. [2021-03-25 23:58:59,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 996 [2021-03-25 23:59:00,467 WARN L205 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 23:59:01,246 WARN L205 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-25 23:59:03,306 WARN L205 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 377 DAG size of output: 317 [2021-03-25 23:59:04,247 WARN L205 SmtUtils]: Spent 937.00 ms on a formula simplification that was a NOOP. DAG size: 306 [2021-03-25 23:59:04,542 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 23:59:04,685 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 23:59:05,100 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-25 23:59:05,473 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-03-25 23:59:06,394 WARN L205 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 309 [2021-03-25 23:59:07,356 WARN L205 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 309 [2021-03-25 23:59:07,470 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-25 23:59:07,576 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-25 23:59:07,753 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-25 23:59:07,929 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-03-25 23:59:07,944 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 23:59:07,944 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 23:59:07,944 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8622 [2021-03-25 23:59:07,945 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 486 flow [2021-03-25 23:59:07,946 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-25 23:59:07,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:07,946 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, 1] [2021-03-25 23:59:07,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 23:59:07,946 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 462533106, now seen corresponding path program 1 times [2021-03-25 23:59:07,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:07,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603936161] [2021-03-25 23:59:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:08,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 23:59:08,029 INFO L142 QuantifierPusher]: treesize reduction 12, result has 63.6 percent of original size [2021-03-25 23:59:08,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 23:59:08,047 INFO L142 QuantifierPusher]: treesize reduction 22, result has 81.0 percent of original size [2021-03-25 23:59:08,050 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.4 percent of original size 85 [2021-03-25 23:59:08,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 23:59:08,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 23:59:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:08,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603936161] [2021-03-25 23:59:08,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:08,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:59:08,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096093078] [2021-03-25 23:59:08,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:59:08,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:59:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:59:08,121 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 223 [2021-03-25 23:59:08,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 486 flow. Second operand has 7 states, 7 states have (on average 145.85714285714286) internal successors, (1021), 7 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:08,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 223 [2021-03-25 23:59:08,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:08,539 INFO L129 PetriNetUnfolder]: 1324/2698 cut-off events. [2021-03-25 23:59:08,540 INFO L130 PetriNetUnfolder]: For 9208/9967 co-relation queries the response was YES. [2021-03-25 23:59:08,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11319 conditions, 2698 events. 1324/2698 cut-off events. For 9208/9967 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 21537 event pairs, 142 based on Foata normal form. 46/2542 useless extension candidates. Maximal degree in co-relation 11281. Up to 892 conditions per place. [2021-03-25 23:59:08,557 INFO L132 encePairwiseOnDemand]: 212/223 looper letters, 18 selfloop transitions, 5 changer transitions 40/90 dead transitions. [2021-03-25 23:59:08,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 781 flow [2021-03-25 23:59:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:59:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:59:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 900 transitions. [2021-03-25 23:59:08,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.672645739910314 [2021-03-25 23:59:08,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 900 transitions. [2021-03-25 23:59:08,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 900 transitions. [2021-03-25 23:59:08,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:08,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 900 transitions. [2021-03-25 23:59:08,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,564 INFO L185 Difference]: Start difference. First operand has 90 places, 64 transitions, 486 flow. Second operand 6 states and 900 transitions. [2021-03-25 23:59:08,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 781 flow [2021-03-25 23:59:08,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 687 flow, removed 20 selfloop flow, removed 14 redundant places. [2021-03-25 23:59:08,706 INFO L241 Difference]: Finished difference. Result has 79 places, 47 transitions, 297 flow [2021-03-25 23:59:08,706 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2021-03-25 23:59:08,706 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2021-03-25 23:59:08,706 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:08,706 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 47 transitions, 297 flow [2021-03-25 23:59:08,706 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 47 transitions, 297 flow [2021-03-25 23:59:08,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 47 transitions, 297 flow [2021-03-25 23:59:08,749 INFO L129 PetriNetUnfolder]: 221/510 cut-off events. [2021-03-25 23:59:08,750 INFO L130 PetriNetUnfolder]: For 787/835 co-relation queries the response was YES. [2021-03-25 23:59:08,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 510 events. 221/510 cut-off events. For 787/835 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2982 event pairs, 37 based on Foata normal form. 11/482 useless extension candidates. Maximal degree in co-relation 1592. Up to 158 conditions per place. [2021-03-25 23:59:08,755 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-25 23:59:08,811 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-25 23:59:08,811 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 23:59:08,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-25 23:59:08,812 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 47 transitions, 304 flow [2021-03-25 23:59:08,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 145.85714285714286) internal successors, (1021), 7 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:08,813 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:08,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 23:59:08,813 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1319637120, now seen corresponding path program 1 times [2021-03-25 23:59:08,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:08,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674073808] [2021-03-25 23:59:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:59:08,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 23:59:08,885 INFO L142 QuantifierPusher]: treesize reduction 6, result has 84.2 percent of original size [2021-03-25 23:59:08,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 23:59:08,919 INFO L142 QuantifierPusher]: treesize reduction 13, result has 70.5 percent of original size [2021-03-25 23:59:08,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 23:59:08,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 23:59:08,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 23:59:08,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:59:08,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:59:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:59:08,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674073808] [2021-03-25 23:59:08,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:59:08,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 23:59:08,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572096054] [2021-03-25 23:59:08,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 23:59:08,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:59:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 23:59:08,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 23:59:08,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 225 [2021-03-25 23:59:08,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 47 transitions, 304 flow. Second operand has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:08,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:59:08,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 225 [2021-03-25 23:59:08,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:59:09,269 INFO L129 PetriNetUnfolder]: 387/876 cut-off events. [2021-03-25 23:59:09,269 INFO L130 PetriNetUnfolder]: For 2178/2395 co-relation queries the response was YES. [2021-03-25 23:59:09,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2899 conditions, 876 events. 387/876 cut-off events. For 2178/2395 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6001 event pairs, 20 based on Foata normal form. 46/859 useless extension candidates. Maximal degree in co-relation 2869. Up to 279 conditions per place. [2021-03-25 23:59:09,273 INFO L132 encePairwiseOnDemand]: 219/225 looper letters, 15 selfloop transitions, 8 changer transitions 5/57 dead transitions. [2021-03-25 23:59:09,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 57 transitions, 425 flow [2021-03-25 23:59:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:59:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:59:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1163 transitions. [2021-03-25 23:59:09,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7384126984126984 [2021-03-25 23:59:09,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1163 transitions. [2021-03-25 23:59:09,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1163 transitions. [2021-03-25 23:59:09,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:59:09,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1163 transitions. [2021-03-25 23:59:09,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.14285714285714) internal successors, (1163), 7 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:09,281 INFO L185 Difference]: Start difference. First operand has 72 places, 47 transitions, 304 flow. Second operand 7 states and 1163 transitions. [2021-03-25 23:59:09,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 57 transitions, 425 flow [2021-03-25 23:59:09,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 57 transitions, 389 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 23:59:09,298 INFO L241 Difference]: Finished difference. Result has 74 places, 46 transitions, 308 flow [2021-03-25 23:59:09,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2021-03-25 23:59:09,299 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2021-03-25 23:59:09,299 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:59:09,299 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 46 transitions, 308 flow [2021-03-25 23:59:09,299 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 46 transitions, 308 flow [2021-03-25 23:59:09,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 46 transitions, 308 flow [2021-03-25 23:59:09,335 INFO L129 PetriNetUnfolder]: 155/367 cut-off events. [2021-03-25 23:59:09,336 INFO L130 PetriNetUnfolder]: For 682/745 co-relation queries the response was YES. [2021-03-25 23:59:09,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 367 events. 155/367 cut-off events. For 682/745 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1969 event pairs, 18 based on Foata normal form. 17/354 useless extension candidates. Maximal degree in co-relation 1144. Up to 119 conditions per place. [2021-03-25 23:59:09,339 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-25 23:59:09,988 WARN L205 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 172 [2021-03-25 23:59:10,344 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-25 23:59:11,603 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-25 23:59:12,179 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 23:59:13,770 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-25 23:59:14,179 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 23:59:16,507 WARN L205 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-25 23:59:17,513 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 309 [2021-03-25 23:59:18,130 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 177 [2021-03-25 23:59:18,468 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2021-03-25 23:59:19,101 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-25 23:59:19,724 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-25 23:59:19,752 INFO L154 LiptonReduction]: Checked pairs total: 75 [2021-03-25 23:59:19,752 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 23:59:19,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10453 [2021-03-25 23:59:19,753 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 310 flow [2021-03-25 23:59:19,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:59:19,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:59:19,753 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:59:19,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 23:59:19,754 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:59:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:59:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 506060349, now seen corresponding path program 1 times [2021-03-25 23:59:19,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:59:19,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934282194] [2021-03-25 23:59:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:59:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 23:59:19,788 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 23:59:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 23:59:19,827 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 23:59:19,858 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 23:59:19,858 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 23:59:19,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 23:59:19,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 11:59:19 BasicIcfg [2021-03-25 23:59:19,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 23:59:19,963 INFO L168 Benchmark]: Toolchain (without parser) took 70553.98 ms. Allocated memory was 255.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 233.6 MB in the beginning and 898.1 MB in the end (delta: -664.6 MB). Peak memory consumption was 824.0 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:19,963 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 23:59:19,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.13 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 233.0 MB in the beginning and 304.3 MB in the end (delta: -71.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:19,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.77 ms. Allocated memory is still 346.0 MB. Free memory was 304.3 MB in the beginning and 301.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:19,964 INFO L168 Benchmark]: Boogie Preprocessor took 41.04 ms. Allocated memory is still 346.0 MB. Free memory was 301.7 MB in the beginning and 299.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:19,964 INFO L168 Benchmark]: RCFGBuilder took 2037.00 ms. Allocated memory was 346.0 MB in the beginning and 421.5 MB in the end (delta: 75.5 MB). Free memory was 299.2 MB in the beginning and 353.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 57.9 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:19,964 INFO L168 Benchmark]: TraceAbstraction took 67899.73 ms. Allocated memory was 421.5 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 353.4 MB in the beginning and 898.1 MB in the end (delta: -544.8 MB). Peak memory consumption was 779.6 MB. Max. memory is 16.0 GB. [2021-03-25 23:59:19,965 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 523.13 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 233.0 MB in the beginning and 304.3 MB in the end (delta: -71.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 42.77 ms. Allocated memory is still 346.0 MB. Free memory was 304.3 MB in the beginning and 301.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.04 ms. Allocated memory is still 346.0 MB. Free memory was 301.7 MB in the beginning and 299.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2037.00 ms. Allocated memory was 346.0 MB in the beginning and 421.5 MB in the end (delta: 75.5 MB). Free memory was 299.2 MB in the beginning and 353.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 57.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 67899.73 ms. Allocated memory was 421.5 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 353.4 MB in the beginning and 898.1 MB in the end (delta: -544.8 MB). Peak memory consumption was 779.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3707.8ms, 128 PlacesBefore, 62 PlacesAfterwards, 117 TransitionsBefore, 50 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5692 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3011, positive: 2889, positive conditional: 2889, positive unconditional: 0, negative: 122, negative conditional: 122, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2092, positive: 2036, positive conditional: 0, positive unconditional: 2036, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2092, positive: 2036, positive conditional: 0, positive unconditional: 2036, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2092, positive: 2032, positive conditional: 0, positive unconditional: 2032, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 784, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 771, negative conditional: 0, negative unconditional: 771, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3011, positive: 853, positive conditional: 853, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 2092, unknown conditional: 2092, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 180, Positive conditional cache size: 180, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1710.6ms, 58 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 33 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2958 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 838, positive: 705, positive conditional: 705, positive unconditional: 0, negative: 133, negative conditional: 133, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, positive: 171, positive conditional: 22, positive unconditional: 149, negative: 40, negative conditional: 6, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 211, positive: 171, positive conditional: 22, positive unconditional: 149, negative: 40, negative conditional: 6, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 211, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 40, negative conditional: 6, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 590, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 567, negative conditional: 154, negative unconditional: 413, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 838, positive: 534, positive conditional: 534, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 211, unknown conditional: 211, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 236, Positive conditional cache size: 236, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1600.5ms, 48 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 966 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 296, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 22, positive conditional: 2, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 22, positive conditional: 2, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 187, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 296, positive: 229, positive conditional: 229, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 258, Positive conditional cache size: 258, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 154.5ms, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 355 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 3, positive unconditional: 9, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 3, positive unconditional: 9, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 100, negative conditional: 4, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 270, Positive conditional cache size: 270, Positive unconditional cache size: 0, Negative cache size: 57, Negative conditional cache size: 57, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.5ms, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 5, positive unconditional: 2, 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: 8, positive: 7, positive conditional: 5, positive unconditional: 2, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 277, Positive conditional cache size: 277, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 176, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 45, positive conditional: 30, positive unconditional: 15, 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: 46, positive: 45, positive conditional: 30, positive unconditional: 15, 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: 46, positive: 45, positive conditional: 0, positive unconditional: 45, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 296, Positive conditional cache size: 296, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 250.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 486 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 82, positive conditional: 82, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 9, positive unconditional: 21, 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: 30, positive: 30, positive conditional: 9, positive unconditional: 21, 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: 30, positive: 30, positive conditional: 0, positive unconditional: 30, 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: 100, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 291, Positive conditional cache size: 291, 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: 202.2ms, 59 PlacesBefore, 59 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 824 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 596 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 21, positive unconditional: 12, 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: 33, positive: 33, positive conditional: 21, positive unconditional: 12, 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: 33, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 114, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 307, Positive conditional cache size: 307, 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: 1945.3ms, 61 PlacesBefore, 61 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 64, positive conditional: 64, 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: 46, positive: 45, positive conditional: 22, positive unconditional: 23, 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: 46, positive: 45, positive conditional: 22, positive unconditional: 23, 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: 46, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 338, Positive conditional cache size: 338, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6339.9ms, 68 PlacesBefore, 68 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 64, positive conditional: 64, 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: 15, positive: 14, positive conditional: 10, positive unconditional: 4, 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: 15, positive: 14, positive conditional: 10, positive unconditional: 4, 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: 15, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 307, Positive conditional cache size: 307, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17744.5ms, 72 PlacesBefore, 72 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 94 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 94, positive conditional: 94, 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: 47, positive: 47, positive conditional: 26, positive unconditional: 21, 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: 47, positive: 47, positive conditional: 26, positive unconditional: 21, 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: 47, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 94, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 798.3ms, 79 PlacesBefore, 79 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1430 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): 354, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1411.0ms, 87 PlacesBefore, 87 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1568 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): 354, Positive cache size: 306, Positive conditional cache size: 306, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8621.5ms, 95 PlacesBefore, 90 PlacesAfterwards, 68 TransitionsBefore, 64 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 70, positive conditional: 70, 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: 70, positive: 70, positive conditional: 65, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 70, positive conditional: 65, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 70, positive conditional: 0, positive unconditional: 70, 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: 70, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 70, unknown conditional: 70, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 270, Positive conditional cache size: 270, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.2ms, 79 PlacesBefore, 72 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 40, 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: 40, positive: 40, positive conditional: 24, positive unconditional: 16, 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: 40, positive: 40, positive conditional: 24, positive unconditional: 16, 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: 40, positive: 40, positive conditional: 0, positive unconditional: 40, 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: 40, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 292, Positive conditional cache size: 292, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10453.1ms, 74 PlacesBefore, 68 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 75, positive conditional: 75, 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: 50, positive: 50, positive conditional: 44, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, positive: 50, positive conditional: 44, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 207, Positive conditional cache size: 207, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, 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_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$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 t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$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 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$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 t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 [L809] 3 __unbuffered_p2_EAX = y [L812] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 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 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 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=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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: 5.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 67623.9ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10242.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3792.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 104 SDtfs, 90 SDslu, 91 SDs, 0 SdLazy, 546 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 627.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 668.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=12, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 49.0ms SsaConstructionTime, 432.1ms SatisfiabilityAnalysisTime, 1212.5ms InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 2584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...