/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix050_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:36:14,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:36:14,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:36:14,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:36:14,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:36:14,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:36:14,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:36:14,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:36:14,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:36:14,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:36:14,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:36:14,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:36:14,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:36:14,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:36:14,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:36:14,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:36:14,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:36:14,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:36:14,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:36:14,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:36:14,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:36:14,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:36:14,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:36:14,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:36:14,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:36:14,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:36:14,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:36:14,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:36:14,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:36:14,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:36:14,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:36:14,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:36:14,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:36:14,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:36:14,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:36:14,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:36:14,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:36:14,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:36:14,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:36:14,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:36:14,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:36:14,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:36:14,984 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:36:14,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:36:14,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:36:14,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:36:14,988 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:36:14,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:36:14,988 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:36:14,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:36:14,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:36:14,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:36:14,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:36:14,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:36:14,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:36:14,989 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:36:14,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:36:14,990 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:36:14,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:36:14,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:36:14,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:36:14,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:36:14,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:36:14,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:36:14,991 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:36:15,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:36:15,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:36:15,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:36:15,254 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:36:15,254 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:36:15,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050_power.opt.i [2021-03-25 14:36:15,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0adf319a/1988b760c1644341ad34009f991b2d71/FLAG9f32d8bd7 [2021-03-25 14:36:15,741 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:36:15,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050_power.opt.i [2021-03-25 14:36:15,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0adf319a/1988b760c1644341ad34009f991b2d71/FLAG9f32d8bd7 [2021-03-25 14:36:15,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0adf319a/1988b760c1644341ad34009f991b2d71 [2021-03-25 14:36:15,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:36:15,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:36:15,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:36:15,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:36:15,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:36:15,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:36:15" (1/1) ... [2021-03-25 14:36:15,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f538ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:15, skipping insertion in model container [2021-03-25 14:36:15,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:36:15" (1/1) ... [2021-03-25 14:36:15,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:36:15,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:36:15,943 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/mix050_power.opt.i[950,963] [2021-03-25 14:36:16,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:36:16,141 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:36:16,150 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/mix050_power.opt.i[950,963] [2021-03-25 14:36:16,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:36:16,234 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:36:16,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16 WrapperNode [2021-03-25 14:36:16,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:36:16,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:36:16,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:36:16,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:36:16,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:36:16,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:36:16,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:36:16,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:36:16,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... [2021-03-25 14:36:16,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:36:16,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:36:16,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:36:16,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:36:16,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:36:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:36:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:36:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:36:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:36:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:36:16,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:36:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:36:16,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:36:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:36:16,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:36:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:36:16,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:36:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:36:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:36:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:36:16,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:36:16,348 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:36:17,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:36:17,805 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:36:17,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:36:17 BoogieIcfgContainer [2021-03-25 14:36:17,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:36:17,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:36:17,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:36:17,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:36:17,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:36:15" (1/3) ... [2021-03-25 14:36:17,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0983e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:36:17, skipping insertion in model container [2021-03-25 14:36:17,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:36:16" (2/3) ... [2021-03-25 14:36:17,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0983e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:36:17, skipping insertion in model container [2021-03-25 14:36:17,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:36:17" (3/3) ... [2021-03-25 14:36:17,810 INFO L111 eAbstractionObserver]: Analyzing ICFG mix050_power.opt.i [2021-03-25 14:36:17,814 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:36:17,817 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:36:17,817 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,851 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,860 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,863 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,868 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,868 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:36:17,873 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:36:17,884 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:36:17,895 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:36:17,895 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:36:17,895 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:36:17,895 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:36:17,895 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:36:17,895 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:36:17,895 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:36:17,895 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:36:17,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:36:17,925 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:36:17,926 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:36:17,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:36:17,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:36:17,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:36:17,931 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:17,938 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:36:17,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:36:17,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:36:17,953 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:36:17,953 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:36:17,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:36:17,956 INFO L142 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-25 14:36:19,074 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:36:19,420 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:36:19,527 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:36:20,818 INFO L154 LiptonReduction]: Checked pairs total: 4644 [2021-03-25 14:36:20,818 INFO L156 LiptonReduction]: Total number of compositions: 73 [2021-03-25 14:36:20,819 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2888 [2021-03-25 14:36:20,824 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:36:20,824 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:36:20,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:20,825 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:36:20,825 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1300694559, now seen corresponding path program 1 times [2021-03-25 14:36:20,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:20,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30411154] [2021-03-25 14:36:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:20,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:20,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:20,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:20,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:21,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30411154] [2021-03-25 14:36:21,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:21,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:36:21,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969130103] [2021-03-25 14:36:21,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:36:21,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:36:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:36:21,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2021-03-25 14:36:21,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:21,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:21,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2021-03-25 14:36:21,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:21,120 INFO L129 PetriNetUnfolder]: 133/369 cut-off events. [2021-03-25 14:36:21,120 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:36:21,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 369 events. 133/369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2083 event pairs, 110 based on Foata normal form. 32/374 useless extension candidates. Maximal degree in co-relation 566. Up to 153 conditions per place. [2021-03-25 14:36:21,125 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 11 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2021-03-25 14:36:21,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 136 flow [2021-03-25 14:36:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:36:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:36:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-25 14:36:21,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175438596491228 [2021-03-25 14:36:21,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-25 14:36:21,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-25 14:36:21,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:21,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-25 14:36:21,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:21,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:21,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:21,152 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 523 transitions. [2021-03-25 14:36:21,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 136 flow [2021-03-25 14:36:21,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:36:21,155 INFO L241 Difference]: Finished difference. Result has 55 places, 44 transitions, 100 flow [2021-03-25 14:36:21,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2021-03-25 14:36:21,159 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-25 14:36:21,159 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:21,159 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 100 flow [2021-03-25 14:36:21,160 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 100 flow [2021-03-25 14:36:21,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 100 flow [2021-03-25 14:36:21,166 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2021-03-25 14:36:21,166 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:36:21,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:36:21,168 INFO L142 LiptonReduction]: Number of co-enabled transitions 576 [2021-03-25 14:36:22,129 INFO L154 LiptonReduction]: Checked pairs total: 2472 [2021-03-25 14:36:22,129 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 14:36:22,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 970 [2021-03-25 14:36:22,130 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-25 14:36:22,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:22,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:22,131 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 14:36:22,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:36:22,131 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 961293898, now seen corresponding path program 1 times [2021-03-25 14:36:22,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:22,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020345232] [2021-03-25 14:36:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:22,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:22,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:22,204 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:36:22,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:36:22,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:22,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:22,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020345232] [2021-03-25 14:36:22,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:22,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:36:22,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454739109] [2021-03-25 14:36:22,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:36:22,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:36:22,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:36:22,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 203 [2021-03-25 14:36:22,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:22,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:22,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 203 [2021-03-25 14:36:22,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:22,280 INFO L129 PetriNetUnfolder]: 122/251 cut-off events. [2021-03-25 14:36:22,281 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:36:22,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 251 events. 122/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1172 event pairs, 63 based on Foata normal form. 16/231 useless extension candidates. Maximal degree in co-relation 453. Up to 166 conditions per place. [2021-03-25 14:36:22,282 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 5 changer transitions 11/45 dead transitions. [2021-03-25 14:36:22,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 146 flow [2021-03-25 14:36:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:36:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:36:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 884 transitions. [2021-03-25 14:36:22,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.870935960591133 [2021-03-25 14:36:22,284 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 884 transitions. [2021-03-25 14:36:22,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 884 transitions. [2021-03-25 14:36:22,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:22,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 884 transitions. [2021-03-25 14:36:22,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:22,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:22,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:22,289 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 884 transitions. [2021-03-25 14:36:22,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 146 flow [2021-03-25 14:36:22,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:36:22,290 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2021-03-25 14:36:22,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-25 14:36:22,290 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -12 predicate places. [2021-03-25 14:36:22,291 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:22,291 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 113 flow [2021-03-25 14:36:22,291 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 113 flow [2021-03-25 14:36:22,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 113 flow [2021-03-25 14:36:22,304 INFO L129 PetriNetUnfolder]: 73/170 cut-off events. [2021-03-25 14:36:22,305 INFO L130 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2021-03-25 14:36:22,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 170 events. 73/170 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 725 event pairs, 40 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 393. Up to 104 conditions per place. [2021-03-25 14:36:22,306 INFO L142 LiptonReduction]: Number of co-enabled transitions 480 [2021-03-25 14:36:22,825 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:36:22,969 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:36:23,275 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:36:23,408 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:36:23,412 INFO L154 LiptonReduction]: Checked pairs total: 1389 [2021-03-25 14:36:23,412 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:36:23,413 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1122 [2021-03-25 14:36:23,413 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 109 flow [2021-03-25 14:36:23,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,414 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:23,414 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:36:23,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:36:23,414 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1958758940, now seen corresponding path program 1 times [2021-03-25 14:36:23,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:23,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443117383] [2021-03-25 14:36:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:23,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,518 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:36:23,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:36:23,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:23,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443117383] [2021-03-25 14:36:23,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:23,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:36:23,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484154290] [2021-03-25 14:36:23,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:36:23,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:36:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:36:23,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:36:23,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:23,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:36:23,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:23,568 INFO L129 PetriNetUnfolder]: 66/160 cut-off events. [2021-03-25 14:36:23,568 INFO L130 PetriNetUnfolder]: For 100/124 co-relation queries the response was YES. [2021-03-25 14:36:23,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 160 events. 66/160 cut-off events. For 100/124 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 623 event pairs, 14 based on Foata normal form. 22/167 useless extension candidates. Maximal degree in co-relation 503. Up to 108 conditions per place. [2021-03-25 14:36:23,569 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 9 changer transitions 9/45 dead transitions. [2021-03-25 14:36:23,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 233 flow [2021-03-25 14:36:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:36:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:36:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2021-03-25 14:36:23,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.865040650406504 [2021-03-25 14:36:23,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1064 transitions. [2021-03-25 14:36:23,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1064 transitions. [2021-03-25 14:36:23,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:23,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1064 transitions. [2021-03-25 14:36:23,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.33333333333334) internal successors, (1064), 6 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,575 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 109 flow. Second operand 6 states and 1064 transitions. [2021-03-25 14:36:23,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 233 flow [2021-03-25 14:36:23,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 226 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:36:23,577 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 174 flow [2021-03-25 14:36:23,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-25 14:36:23,577 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -11 predicate places. [2021-03-25 14:36:23,577 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:23,577 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 174 flow [2021-03-25 14:36:23,578 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 174 flow [2021-03-25 14:36:23,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 174 flow [2021-03-25 14:36:23,586 INFO L129 PetriNetUnfolder]: 49/128 cut-off events. [2021-03-25 14:36:23,586 INFO L130 PetriNetUnfolder]: For 183/198 co-relation queries the response was YES. [2021-03-25 14:36:23,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 128 events. 49/128 cut-off events. For 183/198 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 496 event pairs, 13 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 435. Up to 76 conditions per place. [2021-03-25 14:36:23,587 INFO L142 LiptonReduction]: Number of co-enabled transitions 564 [2021-03-25 14:36:23,589 INFO L154 LiptonReduction]: Checked pairs total: 570 [2021-03-25 14:36:23,589 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:36:23,590 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 14:36:23,590 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 174 flow [2021-03-25 14:36:23,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:23,591 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:36:23,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:36:23,591 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -205500053, now seen corresponding path program 1 times [2021-03-25 14:36:23,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:23,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808383129] [2021-03-25 14:36:23,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:23,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,702 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:36:23,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:36:23,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:23,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808383129] [2021-03-25 14:36:23,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:23,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:36:23,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132381596] [2021-03-25 14:36:23,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:36:23,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:36:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:36:23,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:36:23,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:23,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:36:23,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:23,763 INFO L129 PetriNetUnfolder]: 36/102 cut-off events. [2021-03-25 14:36:23,764 INFO L130 PetriNetUnfolder]: For 194/248 co-relation queries the response was YES. [2021-03-25 14:36:23,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 102 events. 36/102 cut-off events. For 194/248 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 311 event pairs, 2 based on Foata normal form. 25/119 useless extension candidates. Maximal degree in co-relation 431. Up to 68 conditions per place. [2021-03-25 14:36:23,764 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 13 changer transitions 9/49 dead transitions. [2021-03-25 14:36:23,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 356 flow [2021-03-25 14:36:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:36:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:36:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1241 transitions. [2021-03-25 14:36:23,767 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.864808362369338 [2021-03-25 14:36:23,767 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1241 transitions. [2021-03-25 14:36:23,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1241 transitions. [2021-03-25 14:36:23,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:23,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1241 transitions. [2021-03-25 14:36:23,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.28571428571428) internal successors, (1241), 7 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,772 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,772 INFO L185 Difference]: Start difference. First operand has 46 places, 36 transitions, 174 flow. Second operand 7 states and 1241 transitions. [2021-03-25 14:36:23,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 356 flow [2021-03-25 14:36:23,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 294 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 14:36:23,775 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 224 flow [2021-03-25 14:36:23,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-25 14:36:23,775 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2021-03-25 14:36:23,776 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:23,776 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 224 flow [2021-03-25 14:36:23,776 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 224 flow [2021-03-25 14:36:23,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 224 flow [2021-03-25 14:36:23,787 INFO L129 PetriNetUnfolder]: 25/80 cut-off events. [2021-03-25 14:36:23,787 INFO L130 PetriNetUnfolder]: For 135/151 co-relation queries the response was YES. [2021-03-25 14:36:23,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 80 events. 25/80 cut-off events. For 135/151 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 216 event pairs, 2 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 270. Up to 42 conditions per place. [2021-03-25 14:36:23,788 INFO L142 LiptonReduction]: Number of co-enabled transitions 564 [2021-03-25 14:36:23,791 INFO L154 LiptonReduction]: Checked pairs total: 658 [2021-03-25 14:36:23,791 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:36:23,791 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 14:36:23,792 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 224 flow [2021-03-25 14:36:23,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:23,793 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 14:36:23,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:36:23,793 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash 165389404, now seen corresponding path program 1 times [2021-03-25 14:36:23,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:23,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933549473] [2021-03-25 14:36:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:23,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:23,888 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:36:23,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:36:23,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:23,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:23,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933549473] [2021-03-25 14:36:23,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:23,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:36:23,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836047252] [2021-03-25 14:36:23,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:36:23,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:23,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:36:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:36:23,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 205 [2021-03-25 14:36:23,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:23,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 205 [2021-03-25 14:36:23,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:23,947 INFO L129 PetriNetUnfolder]: 20/64 cut-off events. [2021-03-25 14:36:23,947 INFO L130 PetriNetUnfolder]: For 145/199 co-relation queries the response was YES. [2021-03-25 14:36:23,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 64 events. 20/64 cut-off events. For 145/199 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 140 event pairs, 0 based on Foata normal form. 19/79 useless extension candidates. Maximal degree in co-relation 264. Up to 38 conditions per place. [2021-03-25 14:36:23,949 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 2 selfloop transitions, 17 changer transitions 6/45 dead transitions. [2021-03-25 14:36:23,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 328 flow [2021-03-25 14:36:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:36:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:36:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1410 transitions. [2021-03-25 14:36:23,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8597560975609756 [2021-03-25 14:36:23,952 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1410 transitions. [2021-03-25 14:36:23,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1410 transitions. [2021-03-25 14:36:23,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:23,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1410 transitions. [2021-03-25 14:36:23,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 176.25) internal successors, (1410), 8 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,956 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:23,956 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 224 flow. Second operand 8 states and 1410 transitions. [2021-03-25 14:36:23,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 328 flow [2021-03-25 14:36:23,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 266 flow, removed 22 selfloop flow, removed 5 redundant places. [2021-03-25 14:36:23,959 INFO L241 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2021-03-25 14:36:23,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2021-03-25 14:36:23,959 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2021-03-25 14:36:23,959 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:23,959 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 39 transitions, 216 flow [2021-03-25 14:36:23,964 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 39 transitions, 216 flow [2021-03-25 14:36:23,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 216 flow [2021-03-25 14:36:23,969 INFO L129 PetriNetUnfolder]: 17/55 cut-off events. [2021-03-25 14:36:23,969 INFO L130 PetriNetUnfolder]: For 75/85 co-relation queries the response was YES. [2021-03-25 14:36:23,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 55 events. 17/55 cut-off events. For 75/85 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 107 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 163. Up to 18 conditions per place. [2021-03-25 14:36:23,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 452 [2021-03-25 14:36:24,229 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-03-25 14:36:24,367 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-03-25 14:36:24,648 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-25 14:36:24,795 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-25 14:36:24,800 INFO L154 LiptonReduction]: Checked pairs total: 1656 [2021-03-25 14:36:24,800 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:36:24,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 841 [2021-03-25 14:36:24,801 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 212 flow [2021-03-25 14:36:24,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:24,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:24,801 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:36:24,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:36:24,801 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1956811182, now seen corresponding path program 1 times [2021-03-25 14:36:24,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:24,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129873832] [2021-03-25 14:36:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:24,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:24,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:24,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:24,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:24,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:24,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:24,847 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 14:36:24,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:36:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:24,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129873832] [2021-03-25 14:36:24,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:24,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:36:24,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223573256] [2021-03-25 14:36:24,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:36:24,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:24,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:36:24,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:36:24,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 207 [2021-03-25 14:36:24,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 212 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 14:36:24,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:24,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 207 [2021-03-25 14:36:24,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:24,894 INFO L129 PetriNetUnfolder]: 94/227 cut-off events. [2021-03-25 14:36:24,894 INFO L130 PetriNetUnfolder]: For 324/394 co-relation queries the response was YES. [2021-03-25 14:36:24,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 227 events. 94/227 cut-off events. For 324/394 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1183 event pairs, 5 based on Foata normal form. 19/224 useless extension candidates. Maximal degree in co-relation 672. Up to 68 conditions per place. [2021-03-25 14:36:24,895 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 11 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2021-03-25 14:36:24,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 250 flow [2021-03-25 14:36:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:36:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:36:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2021-03-25 14:36:24,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2021-03-25 14:36:24,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2021-03-25 14:36:24,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2021-03-25 14:36:24,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:24,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2021-03-25 14:36:24,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:24,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:24,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:24,899 INFO L185 Difference]: Start difference. First operand has 49 places, 37 transitions, 212 flow. Second operand 4 states and 686 transitions. [2021-03-25 14:36:24,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 250 flow [2021-03-25 14:36:24,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 186 flow, removed 19 selfloop flow, removed 7 redundant places. [2021-03-25 14:36:24,902 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 161 flow [2021-03-25 14:36:24,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:36:24,902 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -12 predicate places. [2021-03-25 14:36:24,902 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:24,902 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 161 flow [2021-03-25 14:36:24,902 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 161 flow [2021-03-25 14:36:24,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 161 flow [2021-03-25 14:36:24,908 INFO L129 PetriNetUnfolder]: 33/86 cut-off events. [2021-03-25 14:36:24,908 INFO L130 PetriNetUnfolder]: For 67/68 co-relation queries the response was YES. [2021-03-25 14:36:24,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 86 events. 33/86 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 279 event pairs, 0 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 212. Up to 26 conditions per place. [2021-03-25 14:36:24,909 INFO L142 LiptonReduction]: Number of co-enabled transitions 478 [2021-03-25 14:36:24,911 INFO L154 LiptonReduction]: Checked pairs total: 521 [2021-03-25 14:36:24,911 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:36:24,911 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:36:24,911 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 161 flow [2021-03-25 14:36:24,912 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 14:36:24,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:24,912 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 14:36:24,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:36:24,912 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2014799285, now seen corresponding path program 1 times [2021-03-25 14:36:24,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:24,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94121015] [2021-03-25 14:36:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:24,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:24,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:24,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:24,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:24,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:24,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:24,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94121015] [2021-03-25 14:36:24,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:24,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:36:24,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155822374] [2021-03-25 14:36:24,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:36:24,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:36:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:36:24,986 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 207 [2021-03-25 14:36:24,987 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:24,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:24,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 207 [2021-03-25 14:36:24,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:25,007 INFO L129 PetriNetUnfolder]: 64/143 cut-off events. [2021-03-25 14:36:25,007 INFO L130 PetriNetUnfolder]: For 175/193 co-relation queries the response was YES. [2021-03-25 14:36:25,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 143 events. 64/143 cut-off events. For 175/193 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 521 event pairs, 0 based on Foata normal form. 5/120 useless extension candidates. Maximal degree in co-relation 370. Up to 50 conditions per place. [2021-03-25 14:36:25,008 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 3 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-25 14:36:25,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 173 flow [2021-03-25 14:36:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:36:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:36:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 714 transitions. [2021-03-25 14:36:25,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8623188405797102 [2021-03-25 14:36:25,009 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 714 transitions. [2021-03-25 14:36:25,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 714 transitions. [2021-03-25 14:36:25,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:25,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 714 transitions. [2021-03-25 14:36:25,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,012 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,012 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 161 flow. Second operand 4 states and 714 transitions. [2021-03-25 14:36:25,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 173 flow [2021-03-25 14:36:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:36:25,015 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 173 flow [2021-03-25 14:36:25,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=173, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2021-03-25 14:36:25,015 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2021-03-25 14:36:25,015 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:25,015 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 173 flow [2021-03-25 14:36:25,016 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 173 flow [2021-03-25 14:36:25,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 173 flow [2021-03-25 14:36:25,026 INFO L129 PetriNetUnfolder]: 64/143 cut-off events. [2021-03-25 14:36:25,026 INFO L130 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2021-03-25 14:36:25,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 143 events. 64/143 cut-off events. For 117/120 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 585 event pairs, 0 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 371. Up to 50 conditions per place. [2021-03-25 14:36:25,028 INFO L142 LiptonReduction]: Number of co-enabled transitions 498 [2021-03-25 14:36:25,031 INFO L154 LiptonReduction]: Checked pairs total: 471 [2021-03-25 14:36:25,031 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:36:25,031 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 14:36:25,031 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 173 flow [2021-03-25 14:36:25,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:25,031 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 14:36:25,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:36:25,032 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2072152607, now seen corresponding path program 2 times [2021-03-25 14:36:25,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:25,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924225139] [2021-03-25 14:36:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:25,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:36:25,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:25,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:25,116 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 14:36:25,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:36:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:25,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924225139] [2021-03-25 14:36:25,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:25,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:36:25,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575142792] [2021-03-25 14:36:25,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:36:25,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:36:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:36:25,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 207 [2021-03-25 14:36:25,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:25,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 207 [2021-03-25 14:36:25,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:25,196 INFO L129 PetriNetUnfolder]: 255/580 cut-off events. [2021-03-25 14:36:25,196 INFO L130 PetriNetUnfolder]: For 735/842 co-relation queries the response was YES. [2021-03-25 14:36:25,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 580 events. 255/580 cut-off events. For 735/842 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3772 event pairs, 7 based on Foata normal form. 24/554 useless extension candidates. Maximal degree in co-relation 1554. Up to 166 conditions per place. [2021-03-25 14:36:25,198 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 8 selfloop transitions, 1 changer transitions 8/47 dead transitions. [2021-03-25 14:36:25,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 239 flow [2021-03-25 14:36:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:36:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:36:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2021-03-25 14:36:25,200 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-03-25 14:36:25,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 690 transitions. [2021-03-25 14:36:25,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 690 transitions. [2021-03-25 14:36:25,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:25,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 690 transitions. [2021-03-25 14:36:25,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,203 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,203 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 173 flow. Second operand 4 states and 690 transitions. [2021-03-25 14:36:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 239 flow [2021-03-25 14:36:25,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:36:25,210 INFO L241 Difference]: Finished difference. Result has 55 places, 38 transitions, 173 flow [2021-03-25 14:36:25,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2021-03-25 14:36:25,210 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-25 14:36:25,210 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:25,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 38 transitions, 173 flow [2021-03-25 14:36:25,211 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 38 transitions, 173 flow [2021-03-25 14:36:25,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 173 flow [2021-03-25 14:36:25,220 INFO L129 PetriNetUnfolder]: 52/146 cut-off events. [2021-03-25 14:36:25,220 INFO L130 PetriNetUnfolder]: For 122/129 co-relation queries the response was YES. [2021-03-25 14:36:25,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 146 events. 52/146 cut-off events. For 122/129 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 673 event pairs, 0 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 372. Up to 46 conditions per place. [2021-03-25 14:36:25,222 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 14:36:25,298 INFO L154 LiptonReduction]: Checked pairs total: 704 [2021-03-25 14:36:25,298 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:36:25,298 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-03-25 14:36:25,298 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 172 flow [2021-03-25 14:36:25,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:25,299 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 14:36:25,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:36:25,299 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 262789653, now seen corresponding path program 3 times [2021-03-25 14:36:25,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:25,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548615680] [2021-03-25 14:36:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:25,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:25,381 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.8 percent of original size [2021-03-25 14:36:25,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:36:25,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:36:25,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:25,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548615680] [2021-03-25 14:36:25,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:25,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:36:25,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603261323] [2021-03-25 14:36:25,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:36:25,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:25,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:36:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:36:25,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 210 [2021-03-25 14:36:25,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:25,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 210 [2021-03-25 14:36:25,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:25,569 INFO L129 PetriNetUnfolder]: 370/850 cut-off events. [2021-03-25 14:36:25,569 INFO L130 PetriNetUnfolder]: For 1053/1199 co-relation queries the response was YES. [2021-03-25 14:36:25,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 850 events. 370/850 cut-off events. For 1053/1199 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6050 event pairs, 64 based on Foata normal form. 67/843 useless extension candidates. Maximal degree in co-relation 2197. Up to 242 conditions per place. [2021-03-25 14:36:25,572 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 9 selfloop transitions, 7 changer transitions 7/51 dead transitions. [2021-03-25 14:36:25,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 248 flow [2021-03-25 14:36:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:36:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:36:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1130 transitions. [2021-03-25 14:36:25,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2021-03-25 14:36:25,575 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1130 transitions. [2021-03-25 14:36:25,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1130 transitions. [2021-03-25 14:36:25,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:25,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1130 transitions. [2021-03-25 14:36:25,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,579 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,579 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 172 flow. Second operand 7 states and 1130 transitions. [2021-03-25 14:36:25,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 248 flow [2021-03-25 14:36:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 242 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:36:25,588 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 207 flow [2021-03-25 14:36:25,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-25 14:36:25,588 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2021-03-25 14:36:25,588 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:25,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 207 flow [2021-03-25 14:36:25,588 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 207 flow [2021-03-25 14:36:25,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 207 flow [2021-03-25 14:36:25,626 INFO L129 PetriNetUnfolder]: 149/369 cut-off events. [2021-03-25 14:36:25,627 INFO L130 PetriNetUnfolder]: For 305/319 co-relation queries the response was YES. [2021-03-25 14:36:25,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 369 events. 149/369 cut-off events. For 305/319 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2294 event pairs, 6 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 1037. Up to 138 conditions per place. [2021-03-25 14:36:25,629 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-25 14:36:25,644 INFO L154 LiptonReduction]: Checked pairs total: 63 [2021-03-25 14:36:25,644 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:36:25,644 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-25 14:36:25,645 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 207 flow [2021-03-25 14:36:25,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:25,645 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 14:36:25,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:36:25,645 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1142014232, now seen corresponding path program 1 times [2021-03-25 14:36:25,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:25,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556377323] [2021-03-25 14:36:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:25,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:36:25,725 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-25 14:36:25,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:36:25,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:36:25,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:36:25,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:25,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:25,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556377323] [2021-03-25 14:36:25,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:25,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:36:25,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060664562] [2021-03-25 14:36:25,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:36:25,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:25,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:36:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:36:25,765 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 210 [2021-03-25 14:36:25,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,766 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:25,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 210 [2021-03-25 14:36:25,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:25,953 INFO L129 PetriNetUnfolder]: 341/796 cut-off events. [2021-03-25 14:36:25,953 INFO L130 PetriNetUnfolder]: For 907/1185 co-relation queries the response was YES. [2021-03-25 14:36:25,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 796 events. 341/796 cut-off events. For 907/1185 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5596 event pairs, 50 based on Foata normal form. 101/823 useless extension candidates. Maximal degree in co-relation 2367. Up to 224 conditions per place. [2021-03-25 14:36:25,956 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 12 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2021-03-25 14:36:25,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 285 flow [2021-03-25 14:36:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:36:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:36:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1099 transitions. [2021-03-25 14:36:25,959 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7476190476190476 [2021-03-25 14:36:25,959 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1099 transitions. [2021-03-25 14:36:25,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1099 transitions. [2021-03-25 14:36:25,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:25,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1099 transitions. [2021-03-25 14:36:25,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.0) internal successors, (1099), 7 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,962 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:25,962 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 207 flow. Second operand 7 states and 1099 transitions. [2021-03-25 14:36:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 285 flow [2021-03-25 14:36:25,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 282 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:36:25,970 INFO L241 Difference]: Finished difference. Result has 62 places, 45 transitions, 257 flow [2021-03-25 14:36:25,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2021-03-25 14:36:25,971 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2021-03-25 14:36:25,971 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:25,971 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 45 transitions, 257 flow [2021-03-25 14:36:25,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 45 transitions, 257 flow [2021-03-25 14:36:25,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 45 transitions, 257 flow [2021-03-25 14:36:25,995 INFO L129 PetriNetUnfolder]: 165/406 cut-off events. [2021-03-25 14:36:25,995 INFO L130 PetriNetUnfolder]: For 426/458 co-relation queries the response was YES. [2021-03-25 14:36:25,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 406 events. 165/406 cut-off events. For 426/458 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2569 event pairs, 4 based on Foata normal form. 5/362 useless extension candidates. Maximal degree in co-relation 1212. Up to 146 conditions per place. [2021-03-25 14:36:25,999 INFO L142 LiptonReduction]: Number of co-enabled transitions 492 [2021-03-25 14:36:26,005 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-25 14:36:26,005 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:36:26,005 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-25 14:36:26,007 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 257 flow [2021-03-25 14:36:26,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 155.14285714285714) internal successors, (1086), 7 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:26,007 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:26,007 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 14:36:26,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:36:26,008 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1657081462, now seen corresponding path program 2 times [2021-03-25 14:36:26,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:26,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259255297] [2021-03-25 14:36:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:26,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:26,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:26,070 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 14:36:26,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:36:26,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:26,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:36:26,093 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-25 14:36:26,097 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-25 14:36:26,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:26,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:26,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259255297] [2021-03-25 14:36:26,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:26,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:36:26,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918398507] [2021-03-25 14:36:26,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:36:26,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:36:26,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:36:26,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 210 [2021-03-25 14:36:26,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:26,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:26,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 210 [2021-03-25 14:36:26,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:26,288 INFO L129 PetriNetUnfolder]: 391/909 cut-off events. [2021-03-25 14:36:26,288 INFO L130 PetriNetUnfolder]: For 1565/1913 co-relation queries the response was YES. [2021-03-25 14:36:26,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 909 events. 391/909 cut-off events. For 1565/1913 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6537 event pairs, 32 based on Foata normal form. 112/946 useless extension candidates. Maximal degree in co-relation 2964. Up to 266 conditions per place. [2021-03-25 14:36:26,292 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 19 selfloop transitions, 12 changer transitions 2/61 dead transitions. [2021-03-25 14:36:26,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 401 flow [2021-03-25 14:36:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:36:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:36:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1135 transitions. [2021-03-25 14:36:26,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7721088435374149 [2021-03-25 14:36:26,294 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1135 transitions. [2021-03-25 14:36:26,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1135 transitions. [2021-03-25 14:36:26,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:26,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1135 transitions. [2021-03-25 14:36:26,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.14285714285714) internal successors, (1135), 7 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:26,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:26,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:26,298 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 257 flow. Second operand 7 states and 1135 transitions. [2021-03-25 14:36:26,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 401 flow [2021-03-25 14:36:26,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 380 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-25 14:36:26,310 INFO L241 Difference]: Finished difference. Result has 70 places, 56 transitions, 356 flow [2021-03-25 14:36:26,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2021-03-25 14:36:26,311 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2021-03-25 14:36:26,311 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:26,311 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 56 transitions, 356 flow [2021-03-25 14:36:26,311 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 56 transitions, 356 flow [2021-03-25 14:36:26,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 56 transitions, 356 flow [2021-03-25 14:36:26,385 INFO L129 PetriNetUnfolder]: 356/859 cut-off events. [2021-03-25 14:36:26,385 INFO L130 PetriNetUnfolder]: For 1272/1351 co-relation queries the response was YES. [2021-03-25 14:36:26,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 859 events. 356/859 cut-off events. For 1272/1351 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6412 event pairs, 27 based on Foata normal form. 28/828 useless extension candidates. Maximal degree in co-relation 2795. Up to 272 conditions per place. [2021-03-25 14:36:26,394 INFO L142 LiptonReduction]: Number of co-enabled transitions 614 [2021-03-25 14:36:27,348 WARN L205 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-25 14:36:27,700 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-25 14:36:29,829 WARN L205 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-25 14:36:30,659 WARN L205 SmtUtils]: Spent 827.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2021-03-25 14:36:31,054 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 213 [2021-03-25 14:36:31,444 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 213 [2021-03-25 14:36:32,311 WARN L205 SmtUtils]: Spent 864.00 ms on a formula simplification that was a NOOP. DAG size: 316 [2021-03-25 14:36:33,175 WARN L205 SmtUtils]: Spent 863.00 ms on a formula simplification that was a NOOP. DAG size: 316 [2021-03-25 14:36:33,218 INFO L154 LiptonReduction]: Checked pairs total: 68 [2021-03-25 14:36:33,218 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:36:33,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6907 [2021-03-25 14:36:33,218 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 362 flow [2021-03-25 14:36:33,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:33,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:33,219 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 14:36:33,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:36:33,219 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash 526940470, now seen corresponding path program 3 times [2021-03-25 14:36:33,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:33,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505571816] [2021-03-25 14:36:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:36:33,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:33,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:36:33,271 INFO L142 QuantifierPusher]: treesize reduction 4, result has 90.5 percent of original size [2021-03-25 14:36:33,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 14:36:33,295 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.4 percent of original size [2021-03-25 14:36:33,296 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.6 percent of original size 46 [2021-03-25 14:36:33,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:33,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:36:33,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:33,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:36:33,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:36:33,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:36:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:36:33,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505571816] [2021-03-25 14:36:33,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:36:33,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:36:33,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299596394] [2021-03-25 14:36:33,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:36:33,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:36:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:36:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:36:33,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 212 [2021-03-25 14:36:33,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 362 flow. Second operand has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:33,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:36:33,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 212 [2021-03-25 14:36:33,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:36:33,603 INFO L129 PetriNetUnfolder]: 399/944 cut-off events. [2021-03-25 14:36:33,603 INFO L130 PetriNetUnfolder]: For 2061/2662 co-relation queries the response was YES. [2021-03-25 14:36:33,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 944 events. 399/944 cut-off events. For 2061/2662 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 7061 event pairs, 22 based on Foata normal form. 176/1040 useless extension candidates. Maximal degree in co-relation 3389. Up to 280 conditions per place. [2021-03-25 14:36:33,611 INFO L132 encePairwiseOnDemand]: 206/212 looper letters, 14 selfloop transitions, 6 changer transitions 16/63 dead transitions. [2021-03-25 14:36:33,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 63 transitions, 480 flow [2021-03-25 14:36:33,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:36:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:36:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 932 transitions. [2021-03-25 14:36:33,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7327044025157232 [2021-03-25 14:36:33,613 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 932 transitions. [2021-03-25 14:36:33,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 932 transitions. [2021-03-25 14:36:33,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:36:33,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 932 transitions. [2021-03-25 14:36:33,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.33333333333334) internal successors, (932), 6 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:33,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:33,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:33,617 INFO L185 Difference]: Start difference. First operand has 70 places, 56 transitions, 362 flow. Second operand 6 states and 932 transitions. [2021-03-25 14:36:33,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 63 transitions, 480 flow [2021-03-25 14:36:33,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 63 transitions, 471 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 14:36:33,629 INFO L241 Difference]: Finished difference. Result has 75 places, 45 transitions, 286 flow [2021-03-25 14:36:33,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=75, PETRI_TRANSITIONS=45} [2021-03-25 14:36:33,630 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2021-03-25 14:36:33,630 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:36:33,630 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 45 transitions, 286 flow [2021-03-25 14:36:33,630 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 45 transitions, 286 flow [2021-03-25 14:36:33,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 45 transitions, 286 flow [2021-03-25 14:36:33,655 INFO L129 PetriNetUnfolder]: 128/367 cut-off events. [2021-03-25 14:36:33,655 INFO L130 PetriNetUnfolder]: For 795/815 co-relation queries the response was YES. [2021-03-25 14:36:33,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 367 events. 128/367 cut-off events. For 795/815 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2349 event pairs, 12 based on Foata normal form. 12/358 useless extension candidates. Maximal degree in co-relation 1225. Up to 114 conditions per place. [2021-03-25 14:36:33,658 INFO L142 LiptonReduction]: Number of co-enabled transitions 370 [2021-03-25 14:36:34,251 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:36:34,519 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:36:35,834 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:36:36,408 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:36:37,009 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:36:37,541 WARN L205 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-25 14:36:38,827 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:36:39,422 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:36:39,429 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-25 14:36:39,429 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:36:39,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5799 [2021-03-25 14:36:39,429 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 286 flow [2021-03-25 14:36:39,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:36:39,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:36:39,430 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 14:36:39,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:36:39,430 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:36:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:36:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash -451020072, now seen corresponding path program 4 times [2021-03-25 14:36:39,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:36:39,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153427100] [2021-03-25 14:36:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:36:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:36:39,456 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:36:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:36:39,509 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:36:39,534 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:36:39,534 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:36:39,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:36:39,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:36:39 BasicIcfg [2021-03-25 14:36:39,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:36:39,602 INFO L168 Benchmark]: Toolchain (without parser) took 23832.00 ms. Allocated memory was 255.9 MB in the beginning and 677.4 MB in the end (delta: 421.5 MB). Free memory was 234.3 MB in the beginning and 620.7 MB in the end (delta: -386.4 MB). Peak memory consumption was 404.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:36:39,602 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:36:39,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.99 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 234.3 MB in the beginning and 348.5 MB in the end (delta: -114.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:36:39,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.52 ms. Allocated memory is still 390.1 MB. Free memory was 348.5 MB in the beginning and 346.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:36:39,603 INFO L168 Benchmark]: Boogie Preprocessor took 23.79 ms. Allocated memory is still 390.1 MB. Free memory was 346.4 MB in the beginning and 343.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:36:39,603 INFO L168 Benchmark]: RCFGBuilder took 1516.99 ms. Allocated memory is still 390.1 MB. Free memory was 343.7 MB in the beginning and 313.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 67.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:36:39,603 INFO L168 Benchmark]: TraceAbstraction took 21794.78 ms. Allocated memory was 390.1 MB in the beginning and 677.4 MB in the end (delta: 287.3 MB). Free memory was 312.8 MB in the beginning and 620.7 MB in the end (delta: -307.9 MB). Peak memory consumption was 348.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:36:39,604 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 461.99 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 234.3 MB in the beginning and 348.5 MB in the end (delta: -114.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 29.52 ms. Allocated memory is still 390.1 MB. Free memory was 348.5 MB in the beginning and 346.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 23.79 ms. Allocated memory is still 390.1 MB. Free memory was 346.4 MB in the beginning and 343.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1516.99 ms. Allocated memory is still 390.1 MB. Free memory was 343.7 MB in the beginning and 313.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 67.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21794.78 ms. Allocated memory was 390.1 MB in the beginning and 677.4 MB in the end (delta: 287.3 MB). Free memory was 312.8 MB in the beginning and 620.7 MB in the end (delta: -307.9 MB). Peak memory consumption was 348.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2877.9ms, 124 PlacesBefore, 59 PlacesAfterwards, 113 TransitionsBefore, 47 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 4644 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2385, positive: 2283, positive conditional: 0, positive unconditional: 2283, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1601, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1601, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1601, positive: 1542, positive conditional: 0, positive unconditional: 1542, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 657, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 638, negative conditional: 0, negative unconditional: 638, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2385, positive: 733, positive conditional: 0, positive unconditional: 733, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 1601, unknown conditional: 0, unknown unconditional: 1601] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 222, Positive conditional cache size: 0, Positive unconditional cache size: 222, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 969.3ms, 55 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 31 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 560, positive conditional: 0, positive unconditional: 560, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 133, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 133, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 218, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 206, negative conditional: 0, negative unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 679, positive: 451, positive conditional: 0, positive unconditional: 451, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 133, unknown conditional: 0, unknown unconditional: 133] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 236, Positive conditional cache size: 0, Positive unconditional cache size: 236, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1121.5ms, 47 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1389 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 328, positive: 265, positive conditional: 0, positive unconditional: 265, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 328, positive: 250, positive conditional: 0, positive unconditional: 250, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 251, Positive conditional cache size: 0, Positive unconditional cache size: 251, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8ms, 48 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 256, Positive conditional cache size: 0, Positive unconditional cache size: 256, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 51 PlacesBefore, 49 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 658 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, positive: 138, positive conditional: 0, positive unconditional: 138, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 835.5ms, 54 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1656 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 498, positive: 420, positive conditional: 0, positive unconditional: 420, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 498, positive: 420, positive conditional: 0, positive unconditional: 420, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 211, Positive conditional cache size: 0, Positive unconditional cache size: 211, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 521 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 123, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 211, Positive conditional cache size: 0, Positive unconditional cache size: 211, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 471 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 128, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 87.2ms, 55 PlacesBefore, 51 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 704 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 158, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.2ms, 57 PlacesBefore, 55 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 63 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ 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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.0ms, 62 PlacesBefore, 62 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6906.8ms, 70 PlacesBefore, 70 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 68 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5799.0ms, 75 PlacesBefore, 67 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 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: 0, positive unconditional: 40, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1325; [L864] FCALL, FORK 0 pthread_create(&t1325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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] [L865] 0 pthread_t t1326; [L866] FCALL, FORK 0 pthread_create(&t1326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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] [L782] 2 x = 1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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=1, y=0, z=0] [L867] 0 pthread_t t1327; [L868] FCALL, FORK 0 pthread_create(&t1327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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] [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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] [L788] 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) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] 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) [L788] 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) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 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 [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 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 [L808] 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) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] 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) [L808] 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) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 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 [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 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 [L869] 0 pthread_t t1328; [L870] FCALL, FORK 0 pthread_create(&t1328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, 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] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 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) [L829] 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) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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)) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 4 __unbuffered_p3_EAX = a [L837] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=49, weak$$choice2=255, x=1, y=1, z=1] [L841] 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) [L841] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L841] 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) [L841] 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) [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 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 [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L845] 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 [L768] 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) [L768] 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) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 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 [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 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 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L876] 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) [L876] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L876] 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) [L876] 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) [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 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 [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L880] 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 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=49, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21641.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1414.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2926.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 60 SDtfs, 48 SDslu, 40 SDs, 0 SdLazy, 491 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 407.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 431.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=11, InterpolantAutomatonStates: 68, 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: 31.4ms SsaConstructionTime, 378.2ms SatisfiabilityAnalysisTime, 790.8ms InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 1543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...