/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/safe000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:46:39,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:46:39,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:46:39,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:46:39,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:46:39,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:46:39,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:46:39,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:46:39,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:46:39,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:46:39,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:46:39,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:46:39,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:46:39,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:46:39,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:46:39,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:46:39,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:46:39,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:46:39,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:46:39,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:46:39,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:46:39,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:46:39,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:46:39,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:46:39,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:46:39,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:46:39,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:46:39,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:46:39,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:46:39,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:46:39,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:46:39,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:46:39,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:46:39,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:46:39,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:46:39,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:46:39,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:46:39,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:46:39,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:46:39,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:46:39,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:46:39,236 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:46:39,270 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:46:39,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:46:39,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:46:39,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:46:39,273 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:46:39,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:46:39,274 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:46:39,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:46:39,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:46:39,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:46:39,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:46:39,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:46:39,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:46:39,276 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:46:39,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:46:39,276 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:46:39,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:46:39,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:46:39,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:46:39,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:46:39,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:46:39,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:46:39,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:46:39,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:46:39,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:46:39,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:46:39,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:46:39,278 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:46:39,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:46:39,278 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:46:39,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:46:39,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:46:39,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:46:39,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:46:39,630 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:46:39,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2021-03-25 14:46:39,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a65836e/bf900b1f2adb4e1795151be16016624d/FLAGcbbeb3533 [2021-03-25 14:46:40,243 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:46:40,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2021-03-25 14:46:40,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a65836e/bf900b1f2adb4e1795151be16016624d/FLAGcbbeb3533 [2021-03-25 14:46:40,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a65836e/bf900b1f2adb4e1795151be16016624d [2021-03-25 14:46:40,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:46:40,708 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:46:40,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:46:40,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:46:40,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:46:40,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:46:40" (1/1) ... [2021-03-25 14:46:40,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a3f813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:40, skipping insertion in model container [2021-03-25 14:46:40,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:46:40" (1/1) ... [2021-03-25 14:46:40,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:46:40,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:46:40,920 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/safe000_power.opt.i[951,964] [2021-03-25 14:46:41,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:46:41,084 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:46:41,091 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/safe000_power.opt.i[951,964] [2021-03-25 14:46:41,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:46:41,188 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:46:41,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41 WrapperNode [2021-03-25 14:46:41,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:46:41,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:46:41,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:46:41,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:46:41,194 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:46:41" (1/1) ... [2021-03-25 14:46:41,210 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:46:41" (1/1) ... [2021-03-25 14:46:41,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:46:41,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:46:41,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:46:41,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:46:41,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (1/1) ... [2021-03-25 14:46:41,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:46:41,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:46:41,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:46:41,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:46:41,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (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:46:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 14:46:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:46:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:46:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:46:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:46:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:46:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:46:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:46:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:46:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:46:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:46:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:46:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:46:41,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:46:41,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:46:41,341 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:46:43,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:46:43,757 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:46:43,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:46:43 BoogieIcfgContainer [2021-03-25 14:46:43,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:46:43,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:46:43,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:46:43,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:46:43,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:46:40" (1/3) ... [2021-03-25 14:46:43,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab86acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:46:43, skipping insertion in model container [2021-03-25 14:46:43,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:46:41" (2/3) ... [2021-03-25 14:46:43,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab86acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:46:43, skipping insertion in model container [2021-03-25 14:46:43,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:46:43" (3/3) ... [2021-03-25 14:46:43,765 INFO L111 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2021-03-25 14:46:43,770 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:46:43,774 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:46:43,775 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,812 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,829 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,858 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:46:43,860 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:46:43,875 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:46:43,893 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:46:43,893 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:46:43,893 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:46:43,893 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:46:43,893 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:46:43,893 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:46:43,893 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:46:43,893 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:46:43,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2021-03-25 14:46:43,937 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:46:43,938 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:46:43,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 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 66 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:46:43,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2021-03-25 14:46:43,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2021-03-25 14:46:43,946 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:46:43,957 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2021-03-25 14:46:43,959 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2021-03-25 14:46:43,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2021-03-25 14:46:43,979 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:46:43,980 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:46:43,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 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 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:46:43,983 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-25 14:46:49,820 WARN L205 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-25 14:46:50,613 WARN L205 SmtUtils]: Spent 789.00 ms on a formula simplification that was a NOOP. DAG size: 361 [2021-03-25 14:46:54,208 WARN L205 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-25 14:46:55,876 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-25 14:47:01,388 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 14:47:01,787 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2021-03-25 14:47:01,941 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 14:47:09,287 INFO L154 LiptonReduction]: Checked pairs total: 3199 [2021-03-25 14:47:09,287 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 14:47:09,291 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25346 [2021-03-25 14:47:09,300 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 14:47:09,300 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:47:09,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:09,301 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:09,301 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:09,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1866008093, now seen corresponding path program 1 times [2021-03-25 14:47:09,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:09,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924672599] [2021-03-25 14:47:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:09,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:09,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:09,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:09,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:09,527 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:47:09,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924672599] [2021-03-25 14:47:09,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:09,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:47:09,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821579444] [2021-03-25 14:47:09,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:47:09,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:47:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:47:09,550 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 193 [2021-03-25 14:47:09,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have 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:47:09,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:09,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 193 [2021-03-25 14:47:09,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:09,667 INFO L129 PetriNetUnfolder]: 49/201 cut-off events. [2021-03-25 14:47:09,667 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:47:09,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 201 events. 49/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1018 event pairs, 24 based on Foata normal form. 14/192 useless extension candidates. Maximal degree in co-relation 273. Up to 65 conditions per place. [2021-03-25 14:47:09,672 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 9 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-25 14:47:09,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 121 flow [2021-03-25 14:47:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:47:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:47:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2021-03-25 14:47:09,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9205526770293609 [2021-03-25 14:47:09,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2021-03-25 14:47:09,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2021-03-25 14:47:09,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:09,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2021-03-25 14:47:09,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:09,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have 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:47:09,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have 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:47:09,717 INFO L185 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 533 transitions. [2021-03-25 14:47:09,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 121 flow [2021-03-25 14:47:09,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:47:09,722 INFO L241 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2021-03-25 14:47:09,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2021-03-25 14:47:09,725 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2021-03-25 14:47:09,725 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:09,725 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 92 flow [2021-03-25 14:47:09,726 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 92 flow [2021-03-25 14:47:09,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 92 flow [2021-03-25 14:47:09,732 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 14:47:09,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:47:09,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:47:09,734 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-25 14:47:10,018 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2021-03-25 14:47:17,929 INFO L154 LiptonReduction]: Checked pairs total: 1128 [2021-03-25 14:47:17,930 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 14:47:17,930 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8205 [2021-03-25 14:47:17,931 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2021-03-25 14:47:17,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have 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:47:17,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:17,932 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:17,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:47:17,932 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1056416686, now seen corresponding path program 1 times [2021-03-25 14:47:17,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:17,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244448631] [2021-03-25 14:47:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:18,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:18,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:18,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:18,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:18,069 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:47:18,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:47:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:47:18,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244448631] [2021-03-25 14:47:18,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:18,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:47:18,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344795885] [2021-03-25 14:47:18,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:47:18,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:47:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:47:18,077 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 207 [2021-03-25 14:47:18,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have 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:47:18,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:18,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 207 [2021-03-25 14:47:18,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:18,119 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2021-03-25 14:47:18,119 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:47:18,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2021-03-25 14:47:18,119 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 1 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2021-03-25 14:47:18,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 80 flow [2021-03-25 14:47:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-03-25 14:47:18,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8859903381642512 [2021-03-25 14:47:18,122 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-03-25 14:47:18,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-03-25 14:47:18,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:18,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-03-25 14:47:18,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have 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:47:18,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have 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:47:18,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have 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:47:18,128 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 5 states and 917 transitions. [2021-03-25 14:47:18,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 80 flow [2021-03-25 14:47:18,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:47:18,129 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 64 flow [2021-03-25 14:47:18,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-25 14:47:18,130 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -14 predicate places. [2021-03-25 14:47:18,130 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:18,130 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 64 flow [2021-03-25 14:47:18,130 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 64 flow [2021-03-25 14:47:18,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 64 flow [2021-03-25 14:47:18,134 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 14:47:18,135 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:47:18,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:47:18,135 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-25 14:47:18,407 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-03-25 14:47:18,959 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:47:19,126 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:47:19,468 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:47:19,661 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:47:19,664 INFO L154 LiptonReduction]: Checked pairs total: 765 [2021-03-25 14:47:19,664 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:47:19,664 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1534 [2021-03-25 14:47:19,665 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-25 14:47:19,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have 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:47:19,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:19,666 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:19,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:47:19,666 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash -916295511, now seen corresponding path program 1 times [2021-03-25 14:47:19,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:19,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365896417] [2021-03-25 14:47:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:19,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:19,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:19,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:19,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:19,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:19,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:19,788 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:47:19,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365896417] [2021-03-25 14:47:19,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:19,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:47:19,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631817984] [2021-03-25 14:47:19,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:47:19,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:19,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:47:19,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:47:19,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 210 [2021-03-25 14:47:19,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 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:47:19,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:19,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 210 [2021-03-25 14:47:19,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:19,837 INFO L129 PetriNetUnfolder]: 11/74 cut-off events. [2021-03-25 14:47:19,838 INFO L130 PetriNetUnfolder]: For 13/30 co-relation queries the response was YES. [2021-03-25 14:47:19,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 74 events. 11/74 cut-off events. For 13/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 323 event pairs, 1 based on Foata normal form. 5/77 useless extension candidates. Maximal degree in co-relation 121. Up to 15 conditions per place. [2021-03-25 14:47:19,840 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 8 selfloop transitions, 5 changer transitions 1/29 dead transitions. [2021-03-25 14:47:19,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 103 flow [2021-03-25 14:47:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:47:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:47:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 724 transitions. [2021-03-25 14:47:19,844 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2021-03-25 14:47:19,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 724 transitions. [2021-03-25 14:47:19,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 724 transitions. [2021-03-25 14:47:19,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:19,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 724 transitions. [2021-03-25 14:47:19,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:47:19,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:47:19,849 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:47:19,849 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 724 transitions. [2021-03-25 14:47:19,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 103 flow [2021-03-25 14:47:19,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 97 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:47:19,851 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 84 flow [2021-03-25 14:47:19,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-25 14:47:19,851 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2021-03-25 14:47:19,851 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:19,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 84 flow [2021-03-25 14:47:19,853 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 84 flow [2021-03-25 14:47:19,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 84 flow [2021-03-25 14:47:19,859 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:47:19,859 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-03-25 14:47:19,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 89 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2021-03-25 14:47:19,861 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-25 14:47:20,499 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-25 14:47:20,752 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-25 14:47:21,353 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-25 14:47:21,627 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-25 14:47:21,630 INFO L154 LiptonReduction]: Checked pairs total: 424 [2021-03-25 14:47:21,630 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:47:21,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1779 [2021-03-25 14:47:21,630 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 80 flow [2021-03-25 14:47:21,631 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:47:21,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:21,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:21,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:47:21,632 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1691233734, now seen corresponding path program 1 times [2021-03-25 14:47:21,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:21,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647148361] [2021-03-25 14:47:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:21,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:21,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:21,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:21,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:47:21,755 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:47:21,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647148361] [2021-03-25 14:47:21,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:21,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:47:21,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876886417] [2021-03-25 14:47:21,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:47:21,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:21,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:47:21,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:47:21,758 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 211 [2021-03-25 14:47:21,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have 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:47:21,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:21,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 211 [2021-03-25 14:47:21,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:21,774 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 14:47:21,775 INFO L130 PetriNetUnfolder]: For 25/28 co-relation queries the response was YES. [2021-03-25 14:47:21,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 35 events. 3/35 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 64. Up to 10 conditions per place. [2021-03-25 14:47:21,775 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-25 14:47:21,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 86 flow [2021-03-25 14:47:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:47:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:47:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-25 14:47:21,781 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8973143759873617 [2021-03-25 14:47:21,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-25 14:47:21,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-25 14:47:21,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:21,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-25 14:47:21,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have 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:47:21,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:21,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:21,784 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 80 flow. Second operand 3 states and 568 transitions. [2021-03-25 14:47:21,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 86 flow [2021-03-25 14:47:21,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 75 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:47:21,786 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 77 flow [2021-03-25 14:47:21,786 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-25 14:47:21,786 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -19 predicate places. [2021-03-25 14:47:21,786 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:21,786 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 77 flow [2021-03-25 14:47:21,786 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 77 flow [2021-03-25 14:47:21,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 77 flow [2021-03-25 14:47:21,791 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 14:47:21,791 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2021-03-25 14:47:21,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 35 events. 3/35 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-25 14:47:21,792 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-25 14:47:21,793 INFO L154 LiptonReduction]: Checked pairs total: 200 [2021-03-25 14:47:21,793 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:47:21,793 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 14:47:21,794 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 77 flow [2021-03-25 14:47:21,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have 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:47:21,794 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:21,794 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:21,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:47:21,795 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash -280631174, now seen corresponding path program 1 times [2021-03-25 14:47:21,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:21,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146496627] [2021-03-25 14:47:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:21,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:21,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:21,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:21,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:21,835 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:47:21,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146496627] [2021-03-25 14:47:21,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:21,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:47:21,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285602638] [2021-03-25 14:47:21,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:47:21,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:47:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:47:21,838 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 211 [2021-03-25 14:47:21,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have 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:47:21,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:21,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 211 [2021-03-25 14:47:21,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:21,864 INFO L129 PetriNetUnfolder]: 6/53 cut-off events. [2021-03-25 14:47:21,864 INFO L130 PetriNetUnfolder]: For 23/27 co-relation queries the response was YES. [2021-03-25 14:47:21,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 53 events. 6/53 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 2 based on Foata normal form. 5/58 useless extension candidates. Maximal degree in co-relation 107. Up to 13 conditions per place. [2021-03-25 14:47:21,865 INFO L132 encePairwiseOnDemand]: 206/211 looper letters, 4 selfloop transitions, 3 changer transitions 4/26 dead transitions. [2021-03-25 14:47:21,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 111 flow [2021-03-25 14:47:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:47:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:47:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 724 transitions. [2021-03-25 14:47:21,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8578199052132701 [2021-03-25 14:47:21,868 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 724 transitions. [2021-03-25 14:47:21,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 724 transitions. [2021-03-25 14:47:21,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:21,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 724 transitions. [2021-03-25 14:47:21,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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:47:21,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:21,872 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:21,872 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 77 flow. Second operand 4 states and 724 transitions. [2021-03-25 14:47:21,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 111 flow [2021-03-25 14:47:21,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:47:21,874 INFO L241 Difference]: Finished difference. Result has 36 places, 21 transitions, 74 flow [2021-03-25 14:47:21,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2021-03-25 14:47:21,874 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -17 predicate places. [2021-03-25 14:47:21,874 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:21,874 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 74 flow [2021-03-25 14:47:21,874 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 21 transitions, 74 flow [2021-03-25 14:47:21,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 21 transitions, 74 flow [2021-03-25 14:47:21,879 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-25 14:47:21,879 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 14:47:21,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 25 events. 1/25 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 44. Up to 6 conditions per place. [2021-03-25 14:47:21,880 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-25 14:47:23,730 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 363 DAG size of output: 363 [2021-03-25 14:47:24,707 WARN L205 SmtUtils]: Spent 974.00 ms on a formula simplification that was a NOOP. DAG size: 363 [2021-03-25 14:47:28,611 WARN L205 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 530 DAG size of output: 530 [2021-03-25 14:47:30,484 WARN L205 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 530 [2021-03-25 14:47:30,489 INFO L154 LiptonReduction]: Checked pairs total: 288 [2021-03-25 14:47:30,489 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:47:30,489 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8615 [2021-03-25 14:47:30,490 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 72 flow [2021-03-25 14:47:30,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.25) internal successors, (717), 4 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have 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:47:30,490 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:30,490 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:30,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:47:30,491 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1024129912, now seen corresponding path program 1 times [2021-03-25 14:47:30,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:30,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398137771] [2021-03-25 14:47:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:30,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:30,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:30,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:30,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:47:30,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398137771] [2021-03-25 14:47:30,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:30,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:47:30,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584456968] [2021-03-25 14:47:30,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:47:30,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:30,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:47:30,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:47:30,569 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 212 [2021-03-25 14:47:30,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:47:30,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:30,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 212 [2021-03-25 14:47:30,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:30,594 INFO L129 PetriNetUnfolder]: 2/29 cut-off events. [2021-03-25 14:47:30,594 INFO L130 PetriNetUnfolder]: For 22/27 co-relation queries the response was YES. [2021-03-25 14:47:30,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 29 events. 2/29 cut-off events. For 22/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 4/32 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2021-03-25 14:47:30,594 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 5 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-25 14:47:30,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 21 transitions, 89 flow [2021-03-25 14:47:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:47:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:47:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2021-03-25 14:47:30,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805031446540881 [2021-03-25 14:47:30,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2021-03-25 14:47:30,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2021-03-25 14:47:30,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:30,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2021-03-25 14:47:30,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have 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:47:30,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:47:30,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:47:30,600 INFO L185 Difference]: Start difference. First operand has 35 places, 20 transitions, 72 flow. Second operand 3 states and 560 transitions. [2021-03-25 14:47:30,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 21 transitions, 89 flow [2021-03-25 14:47:30,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 77 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:47:30,602 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 68 flow [2021-03-25 14:47:30,602 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-25 14:47:30,602 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -19 predicate places. [2021-03-25 14:47:30,602 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:30,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-25 14:47:30,603 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-25 14:47:30,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 68 flow [2021-03-25 14:47:30,609 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 14:47:30,609 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 14:47:30,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 20 events. 0/20 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:47:30,610 INFO L142 LiptonReduction]: Number of co-enabled transitions 150 [2021-03-25 14:47:30,639 INFO L154 LiptonReduction]: Checked pairs total: 305 [2021-03-25 14:47:30,639 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:47:30,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:47:30,640 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 66 flow [2021-03-25 14:47:30,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have 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:47:30,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:30,640 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:30,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:47:30,641 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2108531481, now seen corresponding path program 1 times [2021-03-25 14:47:30,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:30,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466048283] [2021-03-25 14:47:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:30,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:30,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:30,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:30,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:30,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:30,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:30,706 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:47:30,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466048283] [2021-03-25 14:47:30,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:30,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:47:30,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600715810] [2021-03-25 14:47:30,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:47:30,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:47:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:47:30,709 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 213 [2021-03-25 14:47:30,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 66 flow. Second operand has 4 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:47:30,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:30,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 213 [2021-03-25 14:47:30,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:30,740 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 14:47:30,740 INFO L130 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2021-03-25 14:47:30,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 26 events. 0/26 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 5/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-03-25 14:47:30,741 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 3 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2021-03-25 14:47:30,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 21 transitions, 90 flow [2021-03-25 14:47:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 893 transitions. [2021-03-25 14:47:30,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8384976525821596 [2021-03-25 14:47:30,744 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 893 transitions. [2021-03-25 14:47:30,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 893 transitions. [2021-03-25 14:47:30,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:30,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 893 transitions. [2021-03-25 14:47:30,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.6) internal successors, (893), 5 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have 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:47:30,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:30,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:30,748 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 66 flow. Second operand 5 states and 893 transitions. [2021-03-25 14:47:30,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 21 transitions, 90 flow [2021-03-25 14:47:30,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 75 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:47:30,751 INFO L241 Difference]: Finished difference. Result has 35 places, 19 transitions, 64 flow [2021-03-25 14:47:30,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2021-03-25 14:47:30,751 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2021-03-25 14:47:30,751 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:30,752 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 19 transitions, 64 flow [2021-03-25 14:47:30,752 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 19 transitions, 64 flow [2021-03-25 14:47:30,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 64 flow [2021-03-25 14:47:30,756 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 14:47:30,756 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 14:47:30,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 19 events. 0/19 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:47:30,756 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-25 14:47:30,919 INFO L154 LiptonReduction]: Checked pairs total: 128 [2021-03-25 14:47:30,919 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:47:30,919 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-03-25 14:47:30,920 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 64 flow [2021-03-25 14:47:30,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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:47:30,920 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:30,921 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:30,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:47:30,921 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1403998287, now seen corresponding path program 1 times [2021-03-25 14:47:30,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:30,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387916688] [2021-03-25 14:47:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:31,037 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-25 14:47:31,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 14:47:31,112 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-25 14:47:31,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 14:47:31,152 INFO L142 QuantifierPusher]: treesize reduction 3, result has 94.8 percent of original size [2021-03-25 14:47:31,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 14:47:31,201 INFO L142 QuantifierPusher]: treesize reduction 3, result has 95.9 percent of original size [2021-03-25 14:47:31,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-25 14:47:31,259 INFO L142 QuantifierPusher]: treesize reduction 10, result has 61.5 percent of original size [2021-03-25 14:47:31,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:47:31,274 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:47:31,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387916688] [2021-03-25 14:47:31,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:31,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:47:31,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322104768] [2021-03-25 14:47:31,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:47:31,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:47:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:47:31,277 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 213 [2021-03-25 14:47:31,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have 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:47:31,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:31,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 213 [2021-03-25 14:47:31,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:31,459 INFO L129 PetriNetUnfolder]: 46/110 cut-off events. [2021-03-25 14:47:31,459 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2021-03-25 14:47:31,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 110 events. 46/110 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 362 event pairs, 20 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 246. Up to 75 conditions per place. [2021-03-25 14:47:31,460 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 13 selfloop transitions, 8 changer transitions 0/30 dead transitions. [2021-03-25 14:47:31,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 128 flow [2021-03-25 14:47:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2021-03-25 14:47:31,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5849765258215962 [2021-03-25 14:47:31,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2021-03-25 14:47:31,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2021-03-25 14:47:31,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:31,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2021-03-25 14:47:31,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have 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:47:31,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:31,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:31,467 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 64 flow. Second operand 5 states and 623 transitions. [2021-03-25 14:47:31,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 128 flow [2021-03-25 14:47:31,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 118 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:47:31,469 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 102 flow [2021-03-25 14:47:31,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-25 14:47:31,470 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2021-03-25 14:47:31,470 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:31,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 102 flow [2021-03-25 14:47:31,470 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 102 flow [2021-03-25 14:47:31,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 102 flow [2021-03-25 14:47:31,477 INFO L129 PetriNetUnfolder]: 9/44 cut-off events. [2021-03-25 14:47:31,478 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-03-25 14:47:31,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 44 events. 9/44 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 112 event pairs, 4 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 97. Up to 15 conditions per place. [2021-03-25 14:47:31,478 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-25 14:47:31,668 INFO L154 LiptonReduction]: Checked pairs total: 204 [2021-03-25 14:47:31,668 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:47:31,668 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 198 [2021-03-25 14:47:31,669 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 105 flow [2021-03-25 14:47:31,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have 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:47:31,669 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:31,669 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:31,669 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:47:31,669 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -663401462, now seen corresponding path program 1 times [2021-03-25 14:47:31,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:31,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344436247] [2021-03-25 14:47:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:31,864 INFO L142 QuantifierPusher]: treesize reduction 38, result has 64.8 percent of original size [2021-03-25 14:47:31,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-25 14:47:31,928 INFO L142 QuantifierPusher]: treesize reduction 28, result has 70.2 percent of original size [2021-03-25 14:47:31,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-03-25 14:47:31,977 INFO L142 QuantifierPusher]: treesize reduction 37, result has 65.7 percent of original size [2021-03-25 14:47:31,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-25 14:47:32,041 INFO L142 QuantifierPusher]: treesize reduction 48, result has 61.6 percent of original size [2021-03-25 14:47:32,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-25 14:47:32,118 INFO L142 QuantifierPusher]: treesize reduction 71, result has 51.4 percent of original size [2021-03-25 14:47:32,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-03-25 14:47:32,203 INFO L142 QuantifierPusher]: treesize reduction 32, result has 55.6 percent of original size [2021-03-25 14:47:32,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 14:47:32,249 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:47:32,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344436247] [2021-03-25 14:47:32,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:32,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:47:32,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883432120] [2021-03-25 14:47:32,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:47:32,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:47:32,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:47:32,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 214 [2021-03-25 14:47:32,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have 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:47:32,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:32,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 214 [2021-03-25 14:47:32,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:32,457 INFO L129 PetriNetUnfolder]: 50/121 cut-off events. [2021-03-25 14:47:32,457 INFO L130 PetriNetUnfolder]: For 106/114 co-relation queries the response was YES. [2021-03-25 14:47:32,458 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 121 events. 50/121 cut-off events. For 106/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 452 event pairs, 10 based on Foata normal form. 6/125 useless extension candidates. Maximal degree in co-relation 332. Up to 65 conditions per place. [2021-03-25 14:47:32,458 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 17 selfloop transitions, 11 changer transitions 0/37 dead transitions. [2021-03-25 14:47:32,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 204 flow [2021-03-25 14:47:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2021-03-25 14:47:32,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5532710280373832 [2021-03-25 14:47:32,463 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2021-03-25 14:47:32,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2021-03-25 14:47:32,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:32,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2021-03-25 14:47:32,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have 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:47:32,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:32,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:32,468 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 105 flow. Second operand 5 states and 592 transitions. [2021-03-25 14:47:32,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 204 flow [2021-03-25 14:47:32,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:47:32,470 INFO L241 Difference]: Finished difference. Result has 40 places, 32 transitions, 184 flow [2021-03-25 14:47:32,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2021-03-25 14:47:32,470 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -13 predicate places. [2021-03-25 14:47:32,470 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:32,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 184 flow [2021-03-25 14:47:32,471 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 184 flow [2021-03-25 14:47:32,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 184 flow [2021-03-25 14:47:32,487 INFO L129 PetriNetUnfolder]: 45/108 cut-off events. [2021-03-25 14:47:32,487 INFO L130 PetriNetUnfolder]: For 118/120 co-relation queries the response was YES. [2021-03-25 14:47:32,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 108 events. 45/108 cut-off events. For 118/120 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 414 event pairs, 15 based on Foata normal form. 2/105 useless extension candidates. Maximal degree in co-relation 328. Up to 71 conditions per place. [2021-03-25 14:47:32,488 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-25 14:47:32,679 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-25 14:47:32,679 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:47:32,680 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 210 [2021-03-25 14:47:32,680 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 182 flow [2021-03-25 14:47:32,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have 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:47:32,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:32,681 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:32,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:47:32,681 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:32,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:32,681 INFO L82 PathProgramCache]: Analyzing trace with hash 932282205, now seen corresponding path program 1 times [2021-03-25 14:47:32,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:32,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560597537] [2021-03-25 14:47:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:32,804 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-25 14:47:32,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 14:47:32,850 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-25 14:47:32,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 14:47:32,892 INFO L142 QuantifierPusher]: treesize reduction 9, result has 84.2 percent of original size [2021-03-25 14:47:32,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 14:47:32,932 INFO L142 QuantifierPusher]: treesize reduction 7, result has 89.1 percent of original size [2021-03-25 14:47:32,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-25 14:47:32,985 INFO L142 QuantifierPusher]: treesize reduction 6, result has 87.2 percent of original size [2021-03-25 14:47:32,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 14:47:33,028 INFO L142 QuantifierPusher]: treesize reduction 6, result has 88.0 percent of original size [2021-03-25 14:47:33,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:47:33,073 INFO L142 QuantifierPusher]: treesize reduction 6, result has 80.0 percent of original size [2021-03-25 14:47:33,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 14:47:33,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:47:33,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560597537] [2021-03-25 14:47:33,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:33,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:47:33,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32648269] [2021-03-25 14:47:33,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:47:33,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:47:33,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:47:33,119 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 215 [2021-03-25 14:47:33,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have 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:47:33,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:33,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 215 [2021-03-25 14:47:33,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:33,343 INFO L129 PetriNetUnfolder]: 51/121 cut-off events. [2021-03-25 14:47:33,344 INFO L130 PetriNetUnfolder]: For 190/194 co-relation queries the response was YES. [2021-03-25 14:47:33,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 121 events. 51/121 cut-off events. For 190/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 441 event pairs, 4 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 467. Up to 84 conditions per place. [2021-03-25 14:47:33,345 INFO L132 encePairwiseOnDemand]: 207/215 looper letters, 20 selfloop transitions, 11 changer transitions 0/39 dead transitions. [2021-03-25 14:47:33,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 277 flow [2021-03-25 14:47:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2021-03-25 14:47:33,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.573953488372093 [2021-03-25 14:47:33,348 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2021-03-25 14:47:33,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2021-03-25 14:47:33,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:33,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2021-03-25 14:47:33,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have 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:47:33,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have 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:47:33,352 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have 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:47:33,352 INFO L185 Difference]: Start difference. First operand has 39 places, 31 transitions, 182 flow. Second operand 5 states and 617 transitions. [2021-03-25 14:47:33,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 277 flow [2021-03-25 14:47:33,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 256 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:47:33,358 INFO L241 Difference]: Finished difference. Result has 40 places, 35 transitions, 221 flow [2021-03-25 14:47:33,358 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2021-03-25 14:47:33,358 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -13 predicate places. [2021-03-25 14:47:33,359 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:33,359 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 35 transitions, 221 flow [2021-03-25 14:47:33,359 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 35 transitions, 221 flow [2021-03-25 14:47:33,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 221 flow [2021-03-25 14:47:33,375 INFO L129 PetriNetUnfolder]: 46/107 cut-off events. [2021-03-25 14:47:33,375 INFO L130 PetriNetUnfolder]: For 106/112 co-relation queries the response was YES. [2021-03-25 14:47:33,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 107 events. 46/107 cut-off events. For 106/112 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 378 event pairs, 8 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 359. Up to 73 conditions per place. [2021-03-25 14:47:33,376 INFO L142 LiptonReduction]: Number of co-enabled transitions 116 [2021-03-25 14:47:33,595 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2021-03-25 14:47:33,957 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 96 [2021-03-25 14:47:34,294 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2021-03-25 14:47:34,805 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2021-03-25 14:47:34,971 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-25 14:47:34,978 INFO L154 LiptonReduction]: Checked pairs total: 297 [2021-03-25 14:47:34,978 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:47:34,978 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1619 [2021-03-25 14:47:34,979 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 229 flow [2021-03-25 14:47:34,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have 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:47:34,979 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:34,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:34,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:47:34,980 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:34,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash -707998589, now seen corresponding path program 1 times [2021-03-25 14:47:34,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:34,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623823634] [2021-03-25 14:47:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:35,084 INFO L142 QuantifierPusher]: treesize reduction 257, result has 14.6 percent of original size [2021-03-25 14:47:35,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:47:35,124 INFO L142 QuantifierPusher]: treesize reduction 142, result has 25.3 percent of original size [2021-03-25 14:47:35,125 INFO L147 QuantifierPusher]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-03-25 14:47:35,132 INFO L142 QuantifierPusher]: treesize reduction 246, result has 23.6 percent of original size [2021-03-25 14:47:35,134 INFO L147 QuantifierPusher]: treesize reduction 31, result has 59.2 percent of original size 45 [2021-03-25 14:47:35,201 INFO L142 QuantifierPusher]: treesize reduction 409, result has 21.5 percent of original size [2021-03-25 14:47:35,206 INFO L147 QuantifierPusher]: treesize reduction 9, result has 92.0 percent of original size 103 [2021-03-25 14:47:35,304 INFO L142 QuantifierPusher]: treesize reduction 353, result has 10.9 percent of original size [2021-03-25 14:47:35,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 14:47:35,342 INFO L142 QuantifierPusher]: treesize reduction 353, result has 11.5 percent of original size [2021-03-25 14:47:35,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 14:47:35,378 INFO L142 QuantifierPusher]: treesize reduction 102, result has 23.9 percent of original size [2021-03-25 14:47:35,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:47:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:47:35,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623823634] [2021-03-25 14:47:35,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:35,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:47:35,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122464677] [2021-03-25 14:47:35,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:47:35,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:47:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:47:35,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217 [2021-03-25 14:47:35,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have 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:47:35,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:35,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217 [2021-03-25 14:47:35,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:35,660 INFO L129 PetriNetUnfolder]: 53/127 cut-off events. [2021-03-25 14:47:35,660 INFO L130 PetriNetUnfolder]: For 171/175 co-relation queries the response was YES. [2021-03-25 14:47:35,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 127 events. 53/127 cut-off events. For 171/175 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 498 event pairs, 4 based on Foata normal form. 4/128 useless extension candidates. Maximal degree in co-relation 524. Up to 81 conditions per place. [2021-03-25 14:47:35,662 INFO L132 encePairwiseOnDemand]: 208/217 looper letters, 19 selfloop transitions, 16 changer transitions 0/43 dead transitions. [2021-03-25 14:47:35,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 349 flow [2021-03-25 14:47:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2021-03-25 14:47:35,665 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5649769585253456 [2021-03-25 14:47:35,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2021-03-25 14:47:35,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2021-03-25 14:47:35,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:35,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2021-03-25 14:47:35,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have 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:47:35,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have 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:47:35,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have 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:47:35,670 INFO L185 Difference]: Start difference. First operand has 40 places, 35 transitions, 229 flow. Second operand 5 states and 613 transitions. [2021-03-25 14:47:35,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 349 flow [2021-03-25 14:47:35,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 331 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 14:47:35,673 INFO L241 Difference]: Finished difference. Result has 42 places, 38 transitions, 286 flow [2021-03-25 14:47:35,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2021-03-25 14:47:35,674 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2021-03-25 14:47:35,674 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:35,674 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 286 flow [2021-03-25 14:47:35,674 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 286 flow [2021-03-25 14:47:35,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 286 flow [2021-03-25 14:47:35,691 INFO L129 PetriNetUnfolder]: 48/110 cut-off events. [2021-03-25 14:47:35,691 INFO L130 PetriNetUnfolder]: For 216/227 co-relation queries the response was YES. [2021-03-25 14:47:35,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 110 events. 48/110 cut-off events. For 216/227 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 405 event pairs, 11 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 459. Up to 78 conditions per place. [2021-03-25 14:47:35,692 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-25 14:47:35,924 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 14:47:36,101 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 14:47:36,420 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2021-03-25 14:47:36,725 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2021-03-25 14:47:36,730 INFO L154 LiptonReduction]: Checked pairs total: 399 [2021-03-25 14:47:36,730 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:47:36,731 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1056 [2021-03-25 14:47:36,731 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 292 flow [2021-03-25 14:47:36,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have 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:47:36,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:36,731 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:36,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:47:36,731 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -385568269, now seen corresponding path program 1 times [2021-03-25 14:47:36,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:36,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113360922] [2021-03-25 14:47:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:36,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:36,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:36,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:36,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:36,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:36,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:36,791 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:47:36,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113360922] [2021-03-25 14:47:36,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:36,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:47:36,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219974706] [2021-03-25 14:47:36,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:47:36,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:47:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:47:36,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-03-25 14:47:36,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:47:36,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:36,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-03-25 14:47:36,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:36,856 INFO L129 PetriNetUnfolder]: 98/220 cut-off events. [2021-03-25 14:47:36,856 INFO L130 PetriNetUnfolder]: For 402/458 co-relation queries the response was YES. [2021-03-25 14:47:36,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 220 events. 98/220 cut-off events. For 402/458 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1072 event pairs, 35 based on Foata normal form. 51/262 useless extension candidates. Maximal degree in co-relation 746. Up to 110 conditions per place. [2021-03-25 14:47:36,858 INFO L132 encePairwiseOnDemand]: 211/218 looper letters, 10 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2021-03-25 14:47:36,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 312 flow [2021-03-25 14:47:36,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 946 transitions. [2021-03-25 14:47:36,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8678899082568807 [2021-03-25 14:47:36,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 946 transitions. [2021-03-25 14:47:36,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 946 transitions. [2021-03-25 14:47:36,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:36,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 946 transitions. [2021-03-25 14:47:36,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have 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:47:36,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have 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:47:36,865 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have 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:47:36,865 INFO L185 Difference]: Start difference. First operand has 42 places, 38 transitions, 292 flow. Second operand 5 states and 946 transitions. [2021-03-25 14:47:36,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 312 flow [2021-03-25 14:47:36,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 280 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 14:47:36,868 INFO L241 Difference]: Finished difference. Result has 46 places, 41 transitions, 292 flow [2021-03-25 14:47:36,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2021-03-25 14:47:36,868 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2021-03-25 14:47:36,868 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:36,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 292 flow [2021-03-25 14:47:36,869 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 292 flow [2021-03-25 14:47:36,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 292 flow [2021-03-25 14:47:36,896 INFO L129 PetriNetUnfolder]: 101/224 cut-off events. [2021-03-25 14:47:36,896 INFO L130 PetriNetUnfolder]: For 412/447 co-relation queries the response was YES. [2021-03-25 14:47:36,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 224 events. 101/224 cut-off events. For 412/447 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1131 event pairs, 30 based on Foata normal form. 13/226 useless extension candidates. Maximal degree in co-relation 829. Up to 109 conditions per place. [2021-03-25 14:47:36,898 INFO L142 LiptonReduction]: Number of co-enabled transitions 160 [2021-03-25 14:47:36,901 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 14:47:36,901 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:47:36,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 14:47:36,903 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 292 flow [2021-03-25 14:47:36,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:47:36,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:36,904 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:36,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:47:36,904 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:36,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash -554558782, now seen corresponding path program 1 times [2021-03-25 14:47:36,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:36,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616878967] [2021-03-25 14:47:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:36,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:36,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 14:47:36,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:36,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 14:47:37,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 14:47:37,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:47:37,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:47:37,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 14:47:37,100 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:47:37,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616878967] [2021-03-25 14:47:37,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:37,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:47:37,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413727286] [2021-03-25 14:47:37,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:47:37,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:47:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:47:37,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 218 [2021-03-25 14:47:37,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 292 flow. Second operand has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have 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:47:37,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:37,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 218 [2021-03-25 14:47:37,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:37,393 INFO L129 PetriNetUnfolder]: 96/217 cut-off events. [2021-03-25 14:47:37,394 INFO L130 PetriNetUnfolder]: For 546/611 co-relation queries the response was YES. [2021-03-25 14:47:37,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 217 events. 96/217 cut-off events. For 546/611 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1049 event pairs, 34 based on Foata normal form. 21/229 useless extension candidates. Maximal degree in co-relation 905. Up to 104 conditions per place. [2021-03-25 14:47:37,396 INFO L132 encePairwiseOnDemand]: 210/218 looper letters, 18 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2021-03-25 14:47:37,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 338 flow [2021-03-25 14:47:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2021-03-25 14:47:37,399 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.555045871559633 [2021-03-25 14:47:37,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2021-03-25 14:47:37,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2021-03-25 14:47:37,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:37,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2021-03-25 14:47:37,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have 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:47:37,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have 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:47:37,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have 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:47:37,402 INFO L185 Difference]: Start difference. First operand has 46 places, 41 transitions, 292 flow. Second operand 5 states and 605 transitions. [2021-03-25 14:47:37,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 338 flow [2021-03-25 14:47:37,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:47:37,405 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 294 flow [2021-03-25 14:47:37,405 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-25 14:47:37,406 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2021-03-25 14:47:37,406 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:37,406 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 294 flow [2021-03-25 14:47:37,406 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 294 flow [2021-03-25 14:47:37,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 294 flow [2021-03-25 14:47:37,430 INFO L129 PetriNetUnfolder]: 99/221 cut-off events. [2021-03-25 14:47:37,431 INFO L130 PetriNetUnfolder]: For 415/449 co-relation queries the response was YES. [2021-03-25 14:47:37,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 221 events. 99/221 cut-off events. For 415/449 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1066 event pairs, 30 based on Foata normal form. 9/218 useless extension candidates. Maximal degree in co-relation 812. Up to 108 conditions per place. [2021-03-25 14:47:37,433 INFO L142 LiptonReduction]: Number of co-enabled transitions 160 [2021-03-25 14:47:37,435 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-25 14:47:37,435 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:47:37,436 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 14:47:37,436 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 294 flow [2021-03-25 14:47:37,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have 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:47:37,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:37,437 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:37,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:47:37,437 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1613850003, now seen corresponding path program 1 times [2021-03-25 14:47:37,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:37,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717347224] [2021-03-25 14:47:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:37,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:37,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:37,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:37,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:37,504 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:47:37,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717347224] [2021-03-25 14:47:37,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:37,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:47:37,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448361517] [2021-03-25 14:47:37,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:47:37,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:47:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:47:37,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-03-25 14:47:37,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have 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:47:37,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:37,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-03-25 14:47:37,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:37,586 INFO L129 PetriNetUnfolder]: 49/146 cut-off events. [2021-03-25 14:47:37,586 INFO L130 PetriNetUnfolder]: For 526/695 co-relation queries the response was YES. [2021-03-25 14:47:37,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 146 events. 49/146 cut-off events. For 526/695 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 716 event pairs, 6 based on Foata normal form. 95/237 useless extension candidates. Maximal degree in co-relation 590. Up to 80 conditions per place. [2021-03-25 14:47:37,588 INFO L132 encePairwiseOnDemand]: 212/218 looper letters, 6 selfloop transitions, 15 changer transitions 3/48 dead transitions. [2021-03-25 14:47:37,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 382 flow [2021-03-25 14:47:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:47:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:47:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1320 transitions. [2021-03-25 14:47:37,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650065530799476 [2021-03-25 14:47:37,593 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1320 transitions. [2021-03-25 14:47:37,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1320 transitions. [2021-03-25 14:47:37,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:37,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1320 transitions. [2021-03-25 14:47:37,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have 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:47:37,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:37,598 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:47:37,599 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 294 flow. Second operand 7 states and 1320 transitions. [2021-03-25 14:47:37,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 382 flow [2021-03-25 14:47:37,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 364 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:47:37,601 INFO L241 Difference]: Finished difference. Result has 54 places, 45 transitions, 361 flow [2021-03-25 14:47:37,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2021-03-25 14:47:37,602 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2021-03-25 14:47:37,602 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:37,602 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 361 flow [2021-03-25 14:47:37,602 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 361 flow [2021-03-25 14:47:37,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 361 flow [2021-03-25 14:47:37,619 INFO L129 PetriNetUnfolder]: 45/141 cut-off events. [2021-03-25 14:47:37,620 INFO L130 PetriNetUnfolder]: For 477/507 co-relation queries the response was YES. [2021-03-25 14:47:37,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 141 events. 45/141 cut-off events. For 477/507 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 709 event pairs, 4 based on Foata normal form. 9/146 useless extension candidates. Maximal degree in co-relation 617. Up to 75 conditions per place. [2021-03-25 14:47:37,622 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 14:47:37,625 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 14:47:37,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:47:37,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 14:47:37,625 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 361 flow [2021-03-25 14:47:37,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have 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:47:37,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:37,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:37,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:47:37,626 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:37,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1278784820, now seen corresponding path program 1 times [2021-03-25 14:47:37,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:37,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624687881] [2021-03-25 14:47:37,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:37,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:47:37,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 14:47:37,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 14:47:37,808 INFO L142 QuantifierPusher]: treesize reduction 22, result has 59.3 percent of original size [2021-03-25 14:47:37,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:47:37,831 INFO L142 QuantifierPusher]: treesize reduction 22, result has 56.9 percent of original size [2021-03-25 14:47:37,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:47:37,852 INFO L142 QuantifierPusher]: treesize reduction 22, result has 59.3 percent of original size [2021-03-25 14:47:37,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:47:37,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:37,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 14:47:37,903 INFO L142 QuantifierPusher]: treesize reduction 8, result has 61.9 percent of original size [2021-03-25 14:47:37,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:47:37,917 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:47:37,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624687881] [2021-03-25 14:47:37,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:37,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 14:47:37,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257447268] [2021-03-25 14:47:37,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 14:47:37,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:37,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 14:47:37,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-03-25 14:47:37,919 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 218 [2021-03-25 14:47:37,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 361 flow. Second operand has 10 states, 10 states have (on average 116.9) internal successors, (1169), 10 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:47:37,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:37,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 218 [2021-03-25 14:47:37,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:38,197 INFO L129 PetriNetUnfolder]: 51/158 cut-off events. [2021-03-25 14:47:38,197 INFO L130 PetriNetUnfolder]: For 679/754 co-relation queries the response was YES. [2021-03-25 14:47:38,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 158 events. 51/158 cut-off events. For 679/754 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 794 event pairs, 7 based on Foata normal form. 18/171 useless extension candidates. Maximal degree in co-relation 743. Up to 84 conditions per place. [2021-03-25 14:47:38,199 INFO L132 encePairwiseOnDemand]: 209/218 looper letters, 20 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2021-03-25 14:47:38,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 486 flow [2021-03-25 14:47:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:47:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:47:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2021-03-25 14:47:38,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5522935779816514 [2021-03-25 14:47:38,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2021-03-25 14:47:38,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2021-03-25 14:47:38,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:38,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2021-03-25 14:47:38,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have 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:47:38,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have 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:47:38,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have 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:47:38,206 INFO L185 Difference]: Start difference. First operand has 54 places, 45 transitions, 361 flow. Second operand 5 states and 602 transitions. [2021-03-25 14:47:38,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 486 flow [2021-03-25 14:47:38,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 451 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-25 14:47:38,210 INFO L241 Difference]: Finished difference. Result has 58 places, 50 transitions, 417 flow [2021-03-25 14:47:38,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2021-03-25 14:47:38,210 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2021-03-25 14:47:38,210 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:38,210 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 50 transitions, 417 flow [2021-03-25 14:47:38,211 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 50 transitions, 417 flow [2021-03-25 14:47:38,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 50 transitions, 417 flow [2021-03-25 14:47:38,228 INFO L129 PetriNetUnfolder]: 50/155 cut-off events. [2021-03-25 14:47:38,228 INFO L130 PetriNetUnfolder]: For 479/498 co-relation queries the response was YES. [2021-03-25 14:47:38,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 155 events. 50/155 cut-off events. For 479/498 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 793 event pairs, 4 based on Foata normal form. 11/161 useless extension candidates. Maximal degree in co-relation 633. Up to 46 conditions per place. [2021-03-25 14:47:38,230 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 14:47:38,234 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-25 14:47:38,234 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:47:38,234 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 14:47:38,236 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 417 flow [2021-03-25 14:47:38,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 116.9) internal successors, (1169), 10 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have 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:47:38,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:38,243 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:47:38,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:47:38,243 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1955273337, now seen corresponding path program 1 times [2021-03-25 14:47:38,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:38,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843777632] [2021-03-25 14:47:38,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:47:38,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:38,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:38,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:38,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:38,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:38,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:38,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:38,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:47:38,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:47:38,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:47:38,336 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:47:38,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843777632] [2021-03-25 14:47:38,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:47:38,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:47:38,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028549031] [2021-03-25 14:47:38,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:47:38,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:47:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:47:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:47:38,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-03-25 14:47:38,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have 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:47:38,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:47:38,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-03-25 14:47:38,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:47:38,440 INFO L129 PetriNetUnfolder]: 36/126 cut-off events. [2021-03-25 14:47:38,440 INFO L130 PetriNetUnfolder]: For 596/763 co-relation queries the response was YES. [2021-03-25 14:47:38,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 126 events. 36/126 cut-off events. For 596/763 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 662 event pairs, 1 based on Foata normal form. 95/217 useless extension candidates. Maximal degree in co-relation 555. Up to 35 conditions per place. [2021-03-25 14:47:38,442 INFO L132 encePairwiseOnDemand]: 212/218 looper letters, 2 selfloop transitions, 19 changer transitions 3/52 dead transitions. [2021-03-25 14:47:38,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 52 transitions, 473 flow [2021-03-25 14:47:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:47:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:47:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1691 transitions. [2021-03-25 14:47:38,447 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8618756371049949 [2021-03-25 14:47:38,447 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1691 transitions. [2021-03-25 14:47:38,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1691 transitions. [2021-03-25 14:47:38,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:47:38,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1691 transitions. [2021-03-25 14:47:38,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.88888888888889) internal successors, (1691), 9 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:47:38,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have 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:47:38,453 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have 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:47:38,453 INFO L185 Difference]: Start difference. First operand has 58 places, 50 transitions, 417 flow. Second operand 9 states and 1691 transitions. [2021-03-25 14:47:38,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 52 transitions, 473 flow [2021-03-25 14:47:38,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 410 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-25 14:47:38,457 INFO L241 Difference]: Finished difference. Result has 64 places, 49 transitions, 393 flow [2021-03-25 14:47:38,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2021-03-25 14:47:38,457 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2021-03-25 14:47:38,457 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:47:38,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 49 transitions, 393 flow [2021-03-25 14:47:38,458 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 49 transitions, 393 flow [2021-03-25 14:47:38,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 393 flow [2021-03-25 14:47:38,470 INFO L129 PetriNetUnfolder]: 34/123 cut-off events. [2021-03-25 14:47:38,471 INFO L130 PetriNetUnfolder]: For 443/467 co-relation queries the response was YES. [2021-03-25 14:47:38,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 123 events. 34/123 cut-off events. For 443/467 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 628 event pairs, 0 based on Foata normal form. 7/126 useless extension candidates. Maximal degree in co-relation 506. Up to 35 conditions per place. [2021-03-25 14:47:38,472 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-25 14:47:38,613 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:47:38,756 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:47:39,001 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 14:47:39,205 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 14:47:39,430 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-25 14:47:39,623 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-25 14:47:39,958 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 14:47:40,301 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 14:47:40,307 INFO L154 LiptonReduction]: Checked pairs total: 73 [2021-03-25 14:47:40,308 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:47:40,308 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1851 [2021-03-25 14:47:40,308 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 363 flow [2021-03-25 14:47:40,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have 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:47:40,309 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:47:40,309 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:47:40,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:47:40,309 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:47:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:47:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 744544613, now seen corresponding path program 1 times [2021-03-25 14:47:40,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:47:40,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716208449] [2021-03-25 14:47:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:47:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:47:40,360 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:47:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:47:40,412 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:47:40,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:47:40,458 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:47:40,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:47:40,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:47:40 BasicIcfg [2021-03-25 14:47:40,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:47:40,575 INFO L168 Benchmark]: Toolchain (without parser) took 59866.17 ms. Allocated memory was 331.4 MB in the beginning and 597.7 MB in the end (delta: 266.3 MB). Free memory was 294.2 MB in the beginning and 332.0 MB in the end (delta: -37.7 MB). Peak memory consumption was 231.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:47:40,575 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 331.4 MB. Free memory was 312.8 MB in the beginning and 312.7 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:47:40,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.13 ms. Allocated memory is still 331.4 MB. Free memory was 294.0 MB in the beginning and 287.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:47:40,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.11 ms. Allocated memory is still 331.4 MB. Free memory was 287.9 MB in the beginning and 285.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:47:40,575 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 331.4 MB. Free memory was 285.8 MB in the beginning and 282.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:47:40,575 INFO L168 Benchmark]: RCFGBuilder took 2481.79 ms. Allocated memory was 331.4 MB in the beginning and 398.5 MB in the end (delta: 67.1 MB). Free memory was 282.7 MB in the beginning and 290.8 MB in the end (delta: -8.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:47:40,576 INFO L168 Benchmark]: TraceAbstraction took 56813.76 ms. Allocated memory was 398.5 MB in the beginning and 597.7 MB in the end (delta: 199.2 MB). Free memory was 290.8 MB in the beginning and 332.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 159.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:47:40,580 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 331.4 MB. Free memory was 312.8 MB in the beginning and 312.7 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 478.13 ms. Allocated memory is still 331.4 MB. Free memory was 294.0 MB in the beginning and 287.9 MB in the end (delta: 6.1 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.11 ms. Allocated memory is still 331.4 MB. Free memory was 287.9 MB in the beginning and 285.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.64 ms. Allocated memory is still 331.4 MB. Free memory was 285.8 MB in the beginning and 282.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2481.79 ms. Allocated memory was 331.4 MB in the beginning and 398.5 MB in the end (delta: 67.1 MB). Free memory was 282.7 MB in the beginning and 290.8 MB in the end (delta: -8.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 56813.76 ms. Allocated memory was 398.5 MB in the beginning and 597.7 MB in the end (delta: 199.2 MB). Free memory was 290.8 MB in the beginning and 332.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 159.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25328.3ms, 121 PlacesBefore, 53 PlacesAfterwards, 113 TransitionsBefore, 44 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 40 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 3199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1455, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1074, positive: 1033, positive conditional: 0, positive unconditional: 1033, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1074, positive: 1033, positive conditional: 0, positive unconditional: 1033, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1074, positive: 1027, positive conditional: 0, positive unconditional: 1027, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13744, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 460, negative conditional: 0, negative unconditional: 460, unknown: 13271, unknown conditional: 0, unknown unconditional: 13271] ], Cache Queries: [ total: 1455, positive: 332, positive conditional: 0, positive unconditional: 332, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 1074, unknown conditional: 0, unknown unconditional: 1074] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8203.6ms, 50 PlacesBefore, 36 PlacesAfterwards, 41 TransitionsBefore, 27 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 273, positive: 204, positive conditional: 0, positive unconditional: 204, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6379, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 166, negative conditional: 0, negative unconditional: 166, unknown: 6209, unknown conditional: 0, unknown unconditional: 6209] ], Cache Queries: [ total: 273, positive: 154, positive conditional: 0, positive unconditional: 154, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1533.8ms, 39 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 22 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 765 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 195, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, positive: 123, positive conditional: 0, positive unconditional: 123, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1777.1ms, 35 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 424 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 139, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 200 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 75, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8614.8ms, 36 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 84, positive conditional: 0, positive unconditional: 84, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.3ms, 34 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 305 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 92, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.5ms, 35 PlacesBefore, 33 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 161, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 197.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 204 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 208.9ms, 40 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 100, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1619.3ms, 40 PlacesBefore, 40 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1056.3ms, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 399 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 198, positive conditional: 0, positive unconditional: 198, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 231, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.7ms, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.5ms, 49 PlacesBefore, 49 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 6, positive: 3, positive conditional: 0, positive unconditional: 3, 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): 82, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.8ms, 54 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.5ms, 58 PlacesBefore, 58 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 6, positive: 3, positive conditional: 0, positive unconditional: 3, 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): 82, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1850.1ms, 64 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 44 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 73 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L795] EXPR 2 !x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))) [L795] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L796] EXPR 2 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))) [L796] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L797] EXPR 2 !x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))) [L797] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] EXPR 2 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L798] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] EXPR 2 !x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L799] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] EXPR 2 !x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))) [L800] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 [L808] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L760] 1 __unbuffered_p0_EAX = y [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 56569.8ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2248.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25402.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 59 SDtfs, 25 SDslu, 22 SDs, 0 SdLazy, 602 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 891.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1766.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=15, InterpolantAutomatonStates: 78, 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: 57.3ms SsaConstructionTime, 609.1ms SatisfiabilityAnalysisTime, 2523.5ms InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 2877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...