/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:30:15,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:30:15,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:30:15,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:30:15,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:30:15,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:30:15,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:30:15,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:30:15,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:30:15,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:30:15,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:30:15,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:30:15,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:30:15,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:30:15,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:30:15,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:30:15,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:30:15,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:30:15,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:30:15,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:30:15,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:30:15,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:30:15,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:30:15,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:30:15,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:30:15,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:30:15,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:30:15,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:30:15,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:30:15,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:30:15,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:30:15,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:30:15,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:30:15,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:30:15,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:30:15,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:30:15,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:30:15,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:30:15,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:30:15,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:30:15,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:30:15,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:30:15,487 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:30:15,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:30:15,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:30:15,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:30:15,490 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:30:15,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:30:15,490 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:30:15,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:30:15,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:30:15,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:30:15,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:30:15,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:30:15,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:30:15,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:30:15,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:30:15,493 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:30:15,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:30:15,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:30:15,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:30:15,776 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:30:15,777 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:30:15,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc.i [2021-03-25 04:30:15,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7178742/ca54519a1c9947c8bd6ec5b688f17983/FLAGe1f7f32a3 [2021-03-25 04:30:16,356 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:30:16,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc.i [2021-03-25 04:30:16,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7178742/ca54519a1c9947c8bd6ec5b688f17983/FLAGe1f7f32a3 [2021-03-25 04:30:16,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7178742/ca54519a1c9947c8bd6ec5b688f17983 [2021-03-25 04:30:16,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:30:16,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:30:16,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:30:16,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:30:16,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:30:16,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:30:16" (1/1) ... [2021-03-25 04:30:16,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbaf198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:16, skipping insertion in model container [2021-03-25 04:30:16,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:30:16" (1/1) ... [2021-03-25 04:30:16,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:30:16,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:30:17,018 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/mix008_power.oepc.i[951,964] [2021-03-25 04:30:17,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:30:17,152 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:30:17,160 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/mix008_power.oepc.i[951,964] [2021-03-25 04:30:17,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:30:17,263 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:30:17,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17 WrapperNode [2021-03-25 04:30:17,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:30:17,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:30:17,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:30:17,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:30:17,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:30:17,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:30:17,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:30:17,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:30:17,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... [2021-03-25 04:30:17,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:30:17,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:30:17,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:30:17,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:30:17,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:30:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:30:17,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:30:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:30:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:30:17,381 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:30:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:30:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:30:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:30:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:30:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:30:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:30:17,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:30:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:30:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:30:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:30:17,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:30:17,385 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:30:19,089 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:30:19,090 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:30:19,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:30:19 BoogieIcfgContainer [2021-03-25 04:30:19,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:30:19,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:30:19,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:30:19,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:30:19,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:30:16" (1/3) ... [2021-03-25 04:30:19,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f713e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:30:19, skipping insertion in model container [2021-03-25 04:30:19,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:17" (2/3) ... [2021-03-25 04:30:19,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f713e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:30:19, skipping insertion in model container [2021-03-25 04:30:19,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:30:19" (3/3) ... [2021-03-25 04:30:19,097 INFO L111 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc.i [2021-03-25 04:30:19,104 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:30:19,107 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:30:19,108 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:30:19,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,150 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,167 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,173 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,191 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,191 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:19,194 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:30:19,206 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:30:19,231 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:30:19,231 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:30:19,232 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:30:19,232 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:30:19,232 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:30:19,232 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:30:19,232 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:30:19,232 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:30:19,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-25 04:30:19,286 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-25 04:30:19,286 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:19,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:30:19,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-25 04:30:19,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-25 04:30:19,301 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:19,306 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-25 04:30:19,308 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-25 04:30:19,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-25 04:30:19,327 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-25 04:30:19,327 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:19,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:30:19,331 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-25 04:30:20,273 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:30:20,725 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-25 04:30:20,859 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:30:21,744 INFO L154 LiptonReduction]: Checked pairs total: 5838 [2021-03-25 04:30:21,744 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 04:30:21,746 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2446 [2021-03-25 04:30:21,751 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 04:30:21,751 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:21,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:21,752 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:21,752 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash -528227027, now seen corresponding path program 1 times [2021-03-25 04:30:21,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:21,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712413404] [2021-03-25 04:30:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:21,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:21,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:21,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712413404] [2021-03-25 04:30:21,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:21,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:30:21,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865224581] [2021-03-25 04:30:21,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:21,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:21,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 193 [2021-03-25 04:30:21,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:21,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:21,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 193 [2021-03-25 04:30:21,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:22,056 INFO L129 PetriNetUnfolder]: 133/299 cut-off events. [2021-03-25 04:30:22,056 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:22,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 299 events. 133/299 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1437 event pairs, 110 based on Foata normal form. 33/316 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-25 04:30:22,060 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-25 04:30:22,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-25 04:30:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-03-25 04:30:22,075 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9084628670120898 [2021-03-25 04:30:22,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-03-25 04:30:22,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-03-25 04:30:22,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:22,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-03-25 04:30:22,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:22,092 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 04:30:22,093 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 04:30:22,094 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 526 transitions. [2021-03-25 04:30:22,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-25 04:30:22,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:22,098 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-25 04:30:22,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-25 04:30:22,100 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-25 04:30:22,100 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:22,100 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 04:30:22,101 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-25 04:30:22,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-25 04:30:22,110 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-25 04:30:22,111 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:22,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:30:22,113 INFO L142 LiptonReduction]: Number of co-enabled transitions 666 [2021-03-25 04:30:22,409 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:30:22,531 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:30:23,138 INFO L154 LiptonReduction]: Checked pairs total: 2928 [2021-03-25 04:30:23,138 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 04:30:23,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1038 [2021-03-25 04:30:23,139 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-03-25 04:30:23,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:23,139 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 04:30:23,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:30:23,140 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1909215087, now seen corresponding path program 1 times [2021-03-25 04:30:23,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:23,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474010598] [2021-03-25 04:30:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:23,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:23,235 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:23,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:23,246 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:30:23,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:23,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474010598] [2021-03-25 04:30:23,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:23,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:23,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036930009] [2021-03-25 04:30:23,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:23,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:23,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 207 [2021-03-25 04:30:23,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:23,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 207 [2021-03-25 04:30:23,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:23,446 INFO L129 PetriNetUnfolder]: 731/1498 cut-off events. [2021-03-25 04:30:23,446 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:30:23,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1498 events. 731/1498 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 10288 event pairs, 146 based on Foata normal form. 0/1392 useless extension candidates. Maximal degree in co-relation 2603. Up to 461 conditions per place. [2021-03-25 04:30:23,455 INFO L132 encePairwiseOnDemand]: 196/207 looper letters, 10 selfloop transitions, 9 changer transitions 18/57 dead transitions. [2021-03-25 04:30:23,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 200 flow [2021-03-25 04:30:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 843 transitions. [2021-03-25 04:30:23,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8144927536231884 [2021-03-25 04:30:23,458 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 843 transitions. [2021-03-25 04:30:23,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 843 transitions. [2021-03-25 04:30:23,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:23,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 843 transitions. [2021-03-25 04:30:23,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:23,462 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 04:30:23,463 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 04:30:23,463 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 843 transitions. [2021-03-25 04:30:23,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 200 flow [2021-03-25 04:30:23,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:23,464 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 156 flow [2021-03-25 04:30:23,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-25 04:30:23,465 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -12 predicate places. [2021-03-25 04:30:23,465 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:23,465 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 156 flow [2021-03-25 04:30:23,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 156 flow [2021-03-25 04:30:23,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 156 flow [2021-03-25 04:30:23,559 INFO L129 PetriNetUnfolder]: 394/909 cut-off events. [2021-03-25 04:30:23,559 INFO L130 PetriNetUnfolder]: For 305/359 co-relation queries the response was YES. [2021-03-25 04:30:23,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 909 events. 394/909 cut-off events. For 305/359 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6137 event pairs, 162 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 2093. Up to 461 conditions per place. [2021-03-25 04:30:23,567 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-25 04:30:24,422 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:30:24,548 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:30:24,768 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:30:24,877 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:30:25,040 INFO L154 LiptonReduction]: Checked pairs total: 1086 [2021-03-25 04:30:25,040 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:30:25,040 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1575 [2021-03-25 04:30:25,040 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 152 flow [2021-03-25 04:30:25,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:25,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:25,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:30:25,041 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1085137600, now seen corresponding path program 1 times [2021-03-25 04:30:25,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:25,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132810133] [2021-03-25 04:30:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:25,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:25,079 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:25,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:25,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132810133] [2021-03-25 04:30:25,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:25,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:30:25,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863725506] [2021-03-25 04:30:25,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:25,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:25,091 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2021-03-25 04:30:25,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:25,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2021-03-25 04:30:25,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:25,165 INFO L129 PetriNetUnfolder]: 272/710 cut-off events. [2021-03-25 04:30:25,165 INFO L130 PetriNetUnfolder]: For 244/860 co-relation queries the response was YES. [2021-03-25 04:30:25,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 710 events. 272/710 cut-off events. For 244/860 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4703 event pairs, 68 based on Foata normal form. 28/717 useless extension candidates. Maximal degree in co-relation 2022. Up to 324 conditions per place. [2021-03-25 04:30:25,169 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 19 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2021-03-25 04:30:25,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 268 flow [2021-03-25 04:30:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions. [2021-03-25 04:30:25,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8157894736842105 [2021-03-25 04:30:25,171 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 682 transitions. [2021-03-25 04:30:25,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 682 transitions. [2021-03-25 04:30:25,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:25,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 682 transitions. [2021-03-25 04:30:25,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,175 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,175 INFO L185 Difference]: Start difference. First operand has 44 places, 37 transitions, 152 flow. Second operand 4 states and 682 transitions. [2021-03-25 04:30:25,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 268 flow [2021-03-25 04:30:25,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 214 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:25,181 INFO L241 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2021-03-25 04:30:25,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2021-03-25 04:30:25,181 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -15 predicate places. [2021-03-25 04:30:25,181 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:25,181 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 186 flow [2021-03-25 04:30:25,182 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 186 flow [2021-03-25 04:30:25,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 186 flow [2021-03-25 04:30:25,228 INFO L129 PetriNetUnfolder]: 272/678 cut-off events. [2021-03-25 04:30:25,228 INFO L130 PetriNetUnfolder]: For 272/301 co-relation queries the response was YES. [2021-03-25 04:30:25,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 678 events. 272/678 cut-off events. For 272/301 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4391 event pairs, 90 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 1534. Up to 324 conditions per place. [2021-03-25 04:30:25,235 INFO L142 LiptonReduction]: Number of co-enabled transitions 656 [2021-03-25 04:30:25,299 INFO L154 LiptonReduction]: Checked pairs total: 481 [2021-03-25 04:30:25,299 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:25,300 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 119 [2021-03-25 04:30:25,303 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2021-03-25 04:30:25,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,304 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:25,304 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:25,304 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:30:25,304 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1478708792, now seen corresponding path program 1 times [2021-03-25 04:30:25,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:25,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548392275] [2021-03-25 04:30:25,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:25,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:25,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548392275] [2021-03-25 04:30:25,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:25,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:30:25,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143422456] [2021-03-25 04:30:25,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:25,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:25,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 209 [2021-03-25 04:30:25,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:25,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 209 [2021-03-25 04:30:25,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:25,478 INFO L129 PetriNetUnfolder]: 246/656 cut-off events. [2021-03-25 04:30:25,478 INFO L130 PetriNetUnfolder]: For 484/586 co-relation queries the response was YES. [2021-03-25 04:30:25,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 656 events. 246/656 cut-off events. For 484/586 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4278 event pairs, 67 based on Foata normal form. 5/642 useless extension candidates. Maximal degree in co-relation 1566. Up to 292 conditions per place. [2021-03-25 04:30:25,482 INFO L132 encePairwiseOnDemand]: 205/209 looper letters, 7 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2021-03-25 04:30:25,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 240 flow [2021-03-25 04:30:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-25 04:30:25,484 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.886762360446571 [2021-03-25 04:30:25,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-25 04:30:25,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-25 04:30:25,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:25,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-25 04:30:25,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,487 INFO L185 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 3 states and 556 transitions. [2021-03-25 04:30:25,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 240 flow [2021-03-25 04:30:25,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:30:25,491 INFO L241 Difference]: Finished difference. Result has 48 places, 47 transitions, 241 flow [2021-03-25 04:30:25,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2021-03-25 04:30:25,491 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -13 predicate places. [2021-03-25 04:30:25,491 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:25,492 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 241 flow [2021-03-25 04:30:25,492 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 241 flow [2021-03-25 04:30:25,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 241 flow [2021-03-25 04:30:25,563 INFO L129 PetriNetUnfolder]: 246/636 cut-off events. [2021-03-25 04:30:25,563 INFO L130 PetriNetUnfolder]: For 362/405 co-relation queries the response was YES. [2021-03-25 04:30:25,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 636 events. 246/636 cut-off events. For 362/405 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4147 event pairs, 69 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 1564. Up to 292 conditions per place. [2021-03-25 04:30:25,569 INFO L142 LiptonReduction]: Number of co-enabled transitions 734 [2021-03-25 04:30:25,630 INFO L154 LiptonReduction]: Checked pairs total: 628 [2021-03-25 04:30:25,630 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:25,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 139 [2021-03-25 04:30:25,631 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 241 flow [2021-03-25 04:30:25,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:25,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:25,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:30:25,631 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash 470466637, now seen corresponding path program 1 times [2021-03-25 04:30:25,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:25,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509996363] [2021-03-25 04:30:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:25,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:25,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509996363] [2021-03-25 04:30:25,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:25,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:30:25,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122182028] [2021-03-25 04:30:25,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:25,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:25,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:25,694 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 209 [2021-03-25 04:30:25,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:25,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 209 [2021-03-25 04:30:25,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:25,740 INFO L129 PetriNetUnfolder]: 214/566 cut-off events. [2021-03-25 04:30:25,740 INFO L130 PetriNetUnfolder]: For 603/703 co-relation queries the response was YES. [2021-03-25 04:30:25,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 566 events. 214/566 cut-off events. For 603/703 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3506 event pairs, 52 based on Foata normal form. 7/558 useless extension candidates. Maximal degree in co-relation 1441. Up to 256 conditions per place. [2021-03-25 04:30:25,744 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 1 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2021-03-25 04:30:25,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 251 flow [2021-03-25 04:30:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-25 04:30:25,745 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9059011164274322 [2021-03-25 04:30:25,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-25 04:30:25,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-25 04:30:25,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:25,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-25 04:30:25,747 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 04:30:25,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,748 INFO L185 Difference]: Start difference. First operand has 48 places, 47 transitions, 241 flow. Second operand 3 states and 568 transitions. [2021-03-25 04:30:25,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 251 flow [2021-03-25 04:30:25,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:30:25,751 INFO L241 Difference]: Finished difference. Result has 50 places, 47 transitions, 249 flow [2021-03-25 04:30:25,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2021-03-25 04:30:25,751 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2021-03-25 04:30:25,751 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:25,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 249 flow [2021-03-25 04:30:25,752 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 249 flow [2021-03-25 04:30:25,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 249 flow [2021-03-25 04:30:25,793 INFO L129 PetriNetUnfolder]: 214/556 cut-off events. [2021-03-25 04:30:25,793 INFO L130 PetriNetUnfolder]: For 419/433 co-relation queries the response was YES. [2021-03-25 04:30:25,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 556 events. 214/556 cut-off events. For 419/433 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3472 event pairs, 45 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 1444. Up to 256 conditions per place. [2021-03-25 04:30:25,799 INFO L142 LiptonReduction]: Number of co-enabled transitions 732 [2021-03-25 04:30:25,845 INFO L154 LiptonReduction]: Checked pairs total: 649 [2021-03-25 04:30:25,845 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:25,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-25 04:30:25,845 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 249 flow [2021-03-25 04:30:25,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:25,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:25,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:30:25,846 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1745120918, now seen corresponding path program 1 times [2021-03-25 04:30:25,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:25,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133997294] [2021-03-25 04:30:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:25,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:25,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:25,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:25,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:25,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133997294] [2021-03-25 04:30:25,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:25,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:25,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701604236] [2021-03-25 04:30:25,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:25,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:25,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:30:25,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:25,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:25,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:30:25,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:26,117 INFO L129 PetriNetUnfolder]: 1002/2120 cut-off events. [2021-03-25 04:30:26,117 INFO L130 PetriNetUnfolder]: For 855/901 co-relation queries the response was YES. [2021-03-25 04:30:26,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 2120 events. 1002/2120 cut-off events. For 855/901 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 17418 event pairs, 405 based on Foata normal form. 192/2160 useless extension candidates. Maximal degree in co-relation 4843. Up to 1205 conditions per place. [2021-03-25 04:30:26,133 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2021-03-25 04:30:26,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 315 flow [2021-03-25 04:30:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 907 transitions. [2021-03-25 04:30:26,135 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8679425837320575 [2021-03-25 04:30:26,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 907 transitions. [2021-03-25 04:30:26,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 907 transitions. [2021-03-25 04:30:26,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:26,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 907 transitions. [2021-03-25 04:30:26,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:26,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:26,139 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:26,139 INFO L185 Difference]: Start difference. First operand has 50 places, 47 transitions, 249 flow. Second operand 5 states and 907 transitions. [2021-03-25 04:30:26,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 315 flow [2021-03-25 04:30:26,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:26,144 INFO L241 Difference]: Finished difference. Result has 55 places, 56 transitions, 316 flow [2021-03-25 04:30:26,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2021-03-25 04:30:26,144 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2021-03-25 04:30:26,144 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:26,144 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 316 flow [2021-03-25 04:30:26,144 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 316 flow [2021-03-25 04:30:26,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 316 flow [2021-03-25 04:30:26,311 INFO L129 PetriNetUnfolder]: 986/2067 cut-off events. [2021-03-25 04:30:26,311 INFO L130 PetriNetUnfolder]: For 1821/2155 co-relation queries the response was YES. [2021-03-25 04:30:26,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6041 conditions, 2067 events. 986/2067 cut-off events. For 1821/2155 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 16712 event pairs, 373 based on Foata normal form. 38/1961 useless extension candidates. Maximal degree in co-relation 6022. Up to 1199 conditions per place. [2021-03-25 04:30:26,336 INFO L142 LiptonReduction]: Number of co-enabled transitions 1102 [2021-03-25 04:30:27,127 INFO L154 LiptonReduction]: Checked pairs total: 1228 [2021-03-25 04:30:27,127 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:27,127 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 983 [2021-03-25 04:30:27,128 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 310 flow [2021-03-25 04:30:27,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,128 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:27,128 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:27,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:30:27,128 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1129533882, now seen corresponding path program 1 times [2021-03-25 04:30:27,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:27,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133077196] [2021-03-25 04:30:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:27,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:27,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:27,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:27,155 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:27,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:27,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133077196] [2021-03-25 04:30:27,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:27,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:27,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798740740] [2021-03-25 04:30:27,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:27,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:27,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2021-03-25 04:30:27,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:27,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2021-03-25 04:30:27,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:27,397 INFO L129 PetriNetUnfolder]: 1199/2436 cut-off events. [2021-03-25 04:30:27,398 INFO L130 PetriNetUnfolder]: For 2656/3559 co-relation queries the response was YES. [2021-03-25 04:30:27,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7459 conditions, 2436 events. 1199/2436 cut-off events. For 2656/3559 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 19564 event pairs, 542 based on Foata normal form. 80/2305 useless extension candidates. Maximal degree in co-relation 7438. Up to 1513 conditions per place. [2021-03-25 04:30:27,420 INFO L132 encePairwiseOnDemand]: 199/209 looper letters, 22 selfloop transitions, 20 changer transitions 0/65 dead transitions. [2021-03-25 04:30:27,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 457 flow [2021-03-25 04:30:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions. [2021-03-25 04:30:27,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.819377990430622 [2021-03-25 04:30:27,422 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 685 transitions. [2021-03-25 04:30:27,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions. [2021-03-25 04:30:27,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:27,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions. [2021-03-25 04:30:27,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:27,424 INFO L185 Difference]: Start difference. First operand has 55 places, 55 transitions, 310 flow. Second operand 4 states and 685 transitions. [2021-03-25 04:30:27,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 457 flow [2021-03-25 04:30:27,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 450 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:27,442 INFO L241 Difference]: Finished difference. Result has 57 places, 60 transitions, 442 flow [2021-03-25 04:30:27,443 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=442, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2021-03-25 04:30:27,443 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-25 04:30:27,443 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:27,443 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 60 transitions, 442 flow [2021-03-25 04:30:27,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 60 transitions, 442 flow [2021-03-25 04:30:27,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 442 flow [2021-03-25 04:30:27,636 INFO L129 PetriNetUnfolder]: 1221/2439 cut-off events. [2021-03-25 04:30:27,636 INFO L130 PetriNetUnfolder]: For 2335/2662 co-relation queries the response was YES. [2021-03-25 04:30:27,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 2439 events. 1221/2439 cut-off events. For 2335/2662 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 19346 event pairs, 548 based on Foata normal form. 7/2231 useless extension candidates. Maximal degree in co-relation 7022. Up to 1564 conditions per place. [2021-03-25 04:30:27,667 INFO L142 LiptonReduction]: Number of co-enabled transitions 1086 [2021-03-25 04:30:28,387 INFO L154 LiptonReduction]: Checked pairs total: 706 [2021-03-25 04:30:28,388 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:28,388 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 945 [2021-03-25 04:30:28,388 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 442 flow [2021-03-25 04:30:28,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:28,388 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:28,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:30:28,388 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1908605595, now seen corresponding path program 1 times [2021-03-25 04:30:28,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:28,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127010500] [2021-03-25 04:30:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:28,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:28,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:28,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:28,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:28,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:28,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:28,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:28,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:28,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127010500] [2021-03-25 04:30:28,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:28,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:30:28,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510010669] [2021-03-25 04:30:28,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:30:28,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:28,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:30:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:30:28,425 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:30:28,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:28,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:30:28,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:28,614 INFO L129 PetriNetUnfolder]: 871/2042 cut-off events. [2021-03-25 04:30:28,614 INFO L130 PetriNetUnfolder]: For 2449/3371 co-relation queries the response was YES. [2021-03-25 04:30:28,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7391 conditions, 2042 events. 871/2042 cut-off events. For 2449/3371 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 17021 event pairs, 157 based on Foata normal form. 465/2427 useless extension candidates. Maximal degree in co-relation 7367. Up to 1352 conditions per place. [2021-03-25 04:30:28,631 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 10 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2021-03-25 04:30:28,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 566 flow [2021-03-25 04:30:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:30:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:30:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1088 transitions. [2021-03-25 04:30:28,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8676236044657097 [2021-03-25 04:30:28,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1088 transitions. [2021-03-25 04:30:28,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1088 transitions. [2021-03-25 04:30:28,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:28,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1088 transitions. [2021-03-25 04:30:28,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,637 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:28,637 INFO L185 Difference]: Start difference. First operand has 57 places, 60 transitions, 442 flow. Second operand 6 states and 1088 transitions. [2021-03-25 04:30:28,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 566 flow [2021-03-25 04:30:28,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 558 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 04:30:28,642 INFO L241 Difference]: Finished difference. Result has 65 places, 69 transitions, 554 flow [2021-03-25 04:30:28,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2021-03-25 04:30:28,643 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2021-03-25 04:30:28,643 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:28,643 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 69 transitions, 554 flow [2021-03-25 04:30:28,643 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 69 transitions, 554 flow [2021-03-25 04:30:28,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 69 transitions, 554 flow [2021-03-25 04:30:28,875 INFO L129 PetriNetUnfolder]: 895/2073 cut-off events. [2021-03-25 04:30:28,875 INFO L130 PetriNetUnfolder]: For 4739/5634 co-relation queries the response was YES. [2021-03-25 04:30:28,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8774 conditions, 2073 events. 895/2073 cut-off events. For 4739/5634 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 17675 event pairs, 167 based on Foata normal form. 73/2053 useless extension candidates. Maximal degree in co-relation 8747. Up to 1375 conditions per place. [2021-03-25 04:30:28,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 1548 [2021-03-25 04:30:30,540 INFO L154 LiptonReduction]: Checked pairs total: 2185 [2021-03-25 04:30:30,540 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:30,541 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1898 [2021-03-25 04:30:30,541 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 546 flow [2021-03-25 04:30:30,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:30,542 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:30,543 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:30:30,543 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2087100044, now seen corresponding path program 1 times [2021-03-25 04:30:30,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:30,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312202698] [2021-03-25 04:30:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:30,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:30,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:30,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:30,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:30,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:30,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:30,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312202698] [2021-03-25 04:30:30,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:30,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:30,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40401728] [2021-03-25 04:30:30,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:30,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:30,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:30,593 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:30:30,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 546 flow. Second operand has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:30,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:30:30,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:30,772 INFO L129 PetriNetUnfolder]: 1000/2291 cut-off events. [2021-03-25 04:30:30,772 INFO L130 PetriNetUnfolder]: For 5668/6609 co-relation queries the response was YES. [2021-03-25 04:30:30,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9593 conditions, 2291 events. 1000/2291 cut-off events. For 5668/6609 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 18862 event pairs, 217 based on Foata normal form. 136/2327 useless extension candidates. Maximal degree in co-relation 9564. Up to 1393 conditions per place. [2021-03-25 04:30:30,790 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 13 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2021-03-25 04:30:30,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 595 flow [2021-03-25 04:30:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 716 transitions. [2021-03-25 04:30:30,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564593301435407 [2021-03-25 04:30:30,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 716 transitions. [2021-03-25 04:30:30,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 716 transitions. [2021-03-25 04:30:30,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:30,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 716 transitions. [2021-03-25 04:30:30,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,795 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:30,795 INFO L185 Difference]: Start difference. First operand has 65 places, 68 transitions, 546 flow. Second operand 4 states and 716 transitions. [2021-03-25 04:30:30,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 595 flow [2021-03-25 04:30:30,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 557 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:30,843 INFO L241 Difference]: Finished difference. Result has 64 places, 67 transitions, 517 flow [2021-03-25 04:30:30,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=517, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2021-03-25 04:30:30,844 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2021-03-25 04:30:30,844 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:30,844 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 67 transitions, 517 flow [2021-03-25 04:30:30,845 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 67 transitions, 517 flow [2021-03-25 04:30:30,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 67 transitions, 517 flow [2021-03-25 04:30:31,038 INFO L129 PetriNetUnfolder]: 1015/2302 cut-off events. [2021-03-25 04:30:31,039 INFO L130 PetriNetUnfolder]: For 3472/3918 co-relation queries the response was YES. [2021-03-25 04:30:31,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 2302 events. 1015/2302 cut-off events. For 3472/3918 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 18996 event pairs, 234 based on Foata normal form. 97/2286 useless extension candidates. Maximal degree in co-relation 7444. Up to 1286 conditions per place. [2021-03-25 04:30:31,060 INFO L142 LiptonReduction]: Number of co-enabled transitions 1308 [2021-03-25 04:30:32,458 INFO L154 LiptonReduction]: Checked pairs total: 1068 [2021-03-25 04:30:32,458 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:32,458 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1614 [2021-03-25 04:30:32,459 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 517 flow [2021-03-25 04:30:32,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:32,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:32,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:30:32,460 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash 600383630, now seen corresponding path program 2 times [2021-03-25 04:30:32,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:32,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73378051] [2021-03-25 04:30:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:32,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:32,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:32,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:32,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:32,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73378051] [2021-03-25 04:30:32,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:32,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:30:32,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386664113] [2021-03-25 04:30:32,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:30:32,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:30:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:30:32,508 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 04:30:32,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:32,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 04:30:32,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:32,700 INFO L129 PetriNetUnfolder]: 746/1848 cut-off events. [2021-03-25 04:30:32,700 INFO L130 PetriNetUnfolder]: For 3262/4572 co-relation queries the response was YES. [2021-03-25 04:30:32,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7244 conditions, 1848 events. 746/1848 cut-off events. For 3262/4572 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15270 event pairs, 56 based on Foata normal form. 698/2477 useless extension candidates. Maximal degree in co-relation 7216. Up to 1058 conditions per place. [2021-03-25 04:30:32,714 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 18 changer transitions 7/80 dead transitions. [2021-03-25 04:30:32,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 675 flow [2021-03-25 04:30:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:30:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:30:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1269 transitions. [2021-03-25 04:30:32,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8673957621326043 [2021-03-25 04:30:32,717 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1269 transitions. [2021-03-25 04:30:32,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1269 transitions. [2021-03-25 04:30:32,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:32,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1269 transitions. [2021-03-25 04:30:32,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 181.28571428571428) internal successors, (1269), 7 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:32,721 INFO L185 Difference]: Start difference. First operand has 64 places, 67 transitions, 517 flow. Second operand 7 states and 1269 transitions. [2021-03-25 04:30:32,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 675 flow [2021-03-25 04:30:32,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:30:32,727 INFO L241 Difference]: Finished difference. Result has 72 places, 73 transitions, 624 flow [2021-03-25 04:30:32,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=624, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2021-03-25 04:30:32,728 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2021-03-25 04:30:32,728 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:32,728 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 73 transitions, 624 flow [2021-03-25 04:30:32,728 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 73 transitions, 624 flow [2021-03-25 04:30:32,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 73 transitions, 624 flow [2021-03-25 04:30:32,857 INFO L129 PetriNetUnfolder]: 686/1744 cut-off events. [2021-03-25 04:30:32,857 INFO L130 PetriNetUnfolder]: For 4395/4744 co-relation queries the response was YES. [2021-03-25 04:30:32,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7455 conditions, 1744 events. 686/1744 cut-off events. For 4395/4744 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14604 event pairs, 64 based on Foata normal form. 8/1678 useless extension candidates. Maximal degree in co-relation 7425. Up to 1028 conditions per place. [2021-03-25 04:30:32,874 INFO L142 LiptonReduction]: Number of co-enabled transitions 1416 [2021-03-25 04:30:34,079 INFO L154 LiptonReduction]: Checked pairs total: 2498 [2021-03-25 04:30:34,079 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:30:34,079 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1351 [2021-03-25 04:30:34,079 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 616 flow [2021-03-25 04:30:34,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,080 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:34,080 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:34,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:30:34,080 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -158958510, now seen corresponding path program 1 times [2021-03-25 04:30:34,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:34,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393354839] [2021-03-25 04:30:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:34,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:34,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:34,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:34,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:34,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:34,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:34,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:34,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:34,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:34,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:30:34,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:34,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:34,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393354839] [2021-03-25 04:30:34,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:34,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:30:34,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101842954] [2021-03-25 04:30:34,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:30:34,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:34,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:30:34,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:30:34,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:30:34,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 616 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:34,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:30:34,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:34,328 INFO L129 PetriNetUnfolder]: 520/1299 cut-off events. [2021-03-25 04:30:34,328 INFO L130 PetriNetUnfolder]: For 4096/5227 co-relation queries the response was YES. [2021-03-25 04:30:34,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5852 conditions, 1299 events. 520/1299 cut-off events. For 4096/5227 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 9968 event pairs, 38 based on Foata normal form. 371/1606 useless extension candidates. Maximal degree in co-relation 5820. Up to 651 conditions per place. [2021-03-25 04:30:34,335 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 2 selfloop transitions, 18 changer transitions 12/73 dead transitions. [2021-03-25 04:30:34,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 664 flow [2021-03-25 04:30:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:30:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:30:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-03-25 04:30:34,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2021-03-25 04:30:34,338 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-03-25 04:30:34,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-03-25 04:30:34,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:34,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-03-25 04:30:34,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,343 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:34,343 INFO L185 Difference]: Start difference. First operand has 72 places, 72 transitions, 616 flow. Second operand 8 states and 1450 transitions. [2021-03-25 04:30:34,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 664 flow [2021-03-25 04:30:34,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 589 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-03-25 04:30:34,367 INFO L241 Difference]: Finished difference. Result has 73 places, 61 transitions, 476 flow [2021-03-25 04:30:34,367 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=476, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2021-03-25 04:30:34,367 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2021-03-25 04:30:34,367 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:34,367 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 61 transitions, 476 flow [2021-03-25 04:30:34,367 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 61 transitions, 476 flow [2021-03-25 04:30:34,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 61 transitions, 476 flow [2021-03-25 04:30:34,410 INFO L129 PetriNetUnfolder]: 276/727 cut-off events. [2021-03-25 04:30:34,410 INFO L130 PetriNetUnfolder]: For 1434/1515 co-relation queries the response was YES. [2021-03-25 04:30:34,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 727 events. 276/727 cut-off events. For 1434/1515 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5051 event pairs, 37 based on Foata normal form. 4/699 useless extension candidates. Maximal degree in co-relation 2746. Up to 226 conditions per place. [2021-03-25 04:30:34,416 INFO L142 LiptonReduction]: Number of co-enabled transitions 866 [2021-03-25 04:30:34,696 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 04:30:34,832 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 04:30:35,202 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:30:35,353 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:30:35,400 INFO L154 LiptonReduction]: Checked pairs total: 2259 [2021-03-25 04:30:35,401 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:30:35,401 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1034 [2021-03-25 04:30:35,401 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 460 flow [2021-03-25 04:30:35,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:35,401 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:35,401 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:35,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:30:35,401 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:35,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1534246411, now seen corresponding path program 1 times [2021-03-25 04:30:35,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:35,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004627367] [2021-03-25 04:30:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:35,489 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 04:30:35,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 04:30:35,502 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.4 percent of original size [2021-03-25 04:30:35,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 04:30:35,522 INFO L142 QuantifierPusher]: treesize reduction 3, result has 93.3 percent of original size [2021-03-25 04:30:35,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 04:30:35,544 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-25 04:30:35,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:30:35,554 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 04:30:35,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 04:30:35,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:35,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:35,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004627367] [2021-03-25 04:30:35,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:35,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:30:35,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989327194] [2021-03-25 04:30:35,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:30:35,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:30:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:30:35,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 212 [2021-03-25 04:30:35,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 460 flow. Second operand has 8 states, 8 states have (on average 161.125) internal successors, (1289), 8 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:35,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:35,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 212 [2021-03-25 04:30:35,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:36,041 INFO L129 PetriNetUnfolder]: 1442/3297 cut-off events. [2021-03-25 04:30:36,041 INFO L130 PetriNetUnfolder]: For 14531/15602 co-relation queries the response was YES. [2021-03-25 04:30:36,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11421 conditions, 3297 events. 1442/3297 cut-off events. For 14531/15602 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 29435 event pairs, 200 based on Foata normal form. 192/3318 useless extension candidates. Maximal degree in co-relation 11390. Up to 890 conditions per place. [2021-03-25 04:30:36,061 INFO L132 encePairwiseOnDemand]: 204/212 looper letters, 13 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2021-03-25 04:30:36,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 594 flow [2021-03-25 04:30:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:30:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:30:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1144 transitions. [2021-03-25 04:30:36,063 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.77088948787062 [2021-03-25 04:30:36,064 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1144 transitions. [2021-03-25 04:30:36,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1144 transitions. [2021-03-25 04:30:36,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:36,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1144 transitions. [2021-03-25 04:30:36,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.42857142857142) internal successors, (1144), 7 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:36,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:36,068 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:36,068 INFO L185 Difference]: Start difference. First operand has 69 places, 58 transitions, 460 flow. Second operand 7 states and 1144 transitions. [2021-03-25 04:30:36,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 594 flow [2021-03-25 04:30:36,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 520 flow, removed 19 selfloop flow, removed 9 redundant places. [2021-03-25 04:30:36,185 INFO L241 Difference]: Finished difference. Result has 70 places, 73 transitions, 530 flow [2021-03-25 04:30:36,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=530, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2021-03-25 04:30:36,186 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2021-03-25 04:30:36,186 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:36,186 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 73 transitions, 530 flow [2021-03-25 04:30:36,186 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 530 flow [2021-03-25 04:30:36,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 530 flow [2021-03-25 04:30:36,425 INFO L129 PetriNetUnfolder]: 1081/2499 cut-off events. [2021-03-25 04:30:36,425 INFO L130 PetriNetUnfolder]: For 5240/5638 co-relation queries the response was YES. [2021-03-25 04:30:36,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7878 conditions, 2499 events. 1081/2499 cut-off events. For 5240/5638 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 21433 event pairs, 136 based on Foata normal form. 66/2361 useless extension candidates. Maximal degree in co-relation 7850. Up to 774 conditions per place. [2021-03-25 04:30:36,453 INFO L142 LiptonReduction]: Number of co-enabled transitions 1208 [2021-03-25 04:30:36,462 INFO L154 LiptonReduction]: Checked pairs total: 32 [2021-03-25 04:30:36,462 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:36,462 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 276 [2021-03-25 04:30:36,463 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 530 flow [2021-03-25 04:30:36,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 161.125) internal successors, (1289), 8 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:36,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:36,463 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:36,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:30:36,463 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2133155151, now seen corresponding path program 1 times [2021-03-25 04:30:36,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:36,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800459484] [2021-03-25 04:30:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:36,520 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 04:30:36,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 04:30:36,538 INFO L142 QuantifierPusher]: treesize reduction 8, result has 86.4 percent of original size [2021-03-25 04:30:36,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 04:30:36,576 INFO L142 QuantifierPusher]: treesize reduction 13, result has 67.5 percent of original size [2021-03-25 04:30:36,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 04:30:36,598 INFO L142 QuantifierPusher]: treesize reduction 8, result has 84.9 percent of original size [2021-03-25 04:30:36,600 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.0 percent of original size 36 [2021-03-25 04:30:36,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:36,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:30:36,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:36,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:30:36,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800459484] [2021-03-25 04:30:36,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:36,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:30:36,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196453741] [2021-03-25 04:30:36,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:30:36,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:30:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:30:36,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 212 [2021-03-25 04:30:36,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 530 flow. Second operand has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:36,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:36,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 212 [2021-03-25 04:30:36,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:37,286 INFO L129 PetriNetUnfolder]: 1729/3931 cut-off events. [2021-03-25 04:30:37,286 INFO L130 PetriNetUnfolder]: For 13537/15047 co-relation queries the response was YES. [2021-03-25 04:30:37,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13366 conditions, 3931 events. 1729/3931 cut-off events. For 13537/15047 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 36249 event pairs, 190 based on Foata normal form. 343/4035 useless extension candidates. Maximal degree in co-relation 13336. Up to 1097 conditions per place. [2021-03-25 04:30:37,304 INFO L132 encePairwiseOnDemand]: 206/212 looper letters, 21 selfloop transitions, 15 changer transitions 4/88 dead transitions. [2021-03-25 04:30:37,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 709 flow [2021-03-25 04:30:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:30:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:30:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1088 transitions. [2021-03-25 04:30:37,306 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7331536388140162 [2021-03-25 04:30:37,306 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1088 transitions. [2021-03-25 04:30:37,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1088 transitions. [2021-03-25 04:30:37,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:37,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1088 transitions. [2021-03-25 04:30:37,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.42857142857142) internal successors, (1088), 7 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:37,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:37,310 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:37,310 INFO L185 Difference]: Start difference. First operand has 70 places, 73 transitions, 530 flow. Second operand 7 states and 1088 transitions. [2021-03-25 04:30:37,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 709 flow [2021-03-25 04:30:37,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:30:37,475 INFO L241 Difference]: Finished difference. Result has 78 places, 75 transitions, 618 flow [2021-03-25 04:30:37,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=618, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2021-03-25 04:30:37,475 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2021-03-25 04:30:37,476 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:37,476 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 75 transitions, 618 flow [2021-03-25 04:30:37,476 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 75 transitions, 618 flow [2021-03-25 04:30:37,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 75 transitions, 618 flow [2021-03-25 04:30:37,653 INFO L129 PetriNetUnfolder]: 1252/2868 cut-off events. [2021-03-25 04:30:37,653 INFO L130 PetriNetUnfolder]: For 9435/10192 co-relation queries the response was YES. [2021-03-25 04:30:37,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9481 conditions, 2868 events. 1252/2868 cut-off events. For 9435/10192 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 25471 event pairs, 129 based on Foata normal form. 114/2737 useless extension candidates. Maximal degree in co-relation 9449. Up to 919 conditions per place. [2021-03-25 04:30:37,680 INFO L142 LiptonReduction]: Number of co-enabled transitions 1198 [2021-03-25 04:30:37,686 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-25 04:30:37,686 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:37,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 210 [2021-03-25 04:30:37,686 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 618 flow [2021-03-25 04:30:37,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:37,686 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:37,686 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:37,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:30:37,687 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash 49250907, now seen corresponding path program 2 times [2021-03-25 04:30:37,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:37,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101908567] [2021-03-25 04:30:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:30:37,735 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:30:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:30:37,814 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:30:37,860 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:30:37,860 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:30:37,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:30:37,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:30:37 BasicIcfg [2021-03-25 04:30:37,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:30:37,971 INFO L168 Benchmark]: Toolchain (without parser) took 21110.29 ms. Allocated memory was 308.3 MB in the beginning and 738.2 MB in the end (delta: 429.9 MB). Free memory was 270.4 MB in the beginning and 318.5 MB in the end (delta: -48.0 MB). Peak memory consumption was 385.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:37,971 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 308.3 MB. Free memory was 289.7 MB in the beginning and 289.6 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:30:37,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.98 ms. Allocated memory is still 308.3 MB. Free memory was 270.3 MB in the beginning and 266.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:37,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.47 ms. Allocated memory is still 308.3 MB. Free memory was 266.0 MB in the beginning and 262.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:37,971 INFO L168 Benchmark]: Boogie Preprocessor took 23.67 ms. Allocated memory is still 308.3 MB. Free memory was 262.8 MB in the beginning and 260.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:37,971 INFO L168 Benchmark]: RCFGBuilder took 1760.63 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 185.5 MB in the end (delta: 75.2 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:37,972 INFO L168 Benchmark]: TraceAbstraction took 18877.46 ms. Allocated memory was 308.3 MB in the beginning and 738.2 MB in the end (delta: 429.9 MB). Free memory was 185.5 MB in the beginning and 318.5 MB in the end (delta: -133.0 MB). Peak memory consumption was 297.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:37,972 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.41 ms. Allocated memory is still 308.3 MB. Free memory was 289.7 MB in the beginning and 289.6 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 402.98 ms. Allocated memory is still 308.3 MB. Free memory was 270.3 MB in the beginning and 266.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.47 ms. Allocated memory is still 308.3 MB. Free memory was 266.0 MB in the beginning and 262.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 23.67 ms. Allocated memory is still 308.3 MB. Free memory was 262.8 MB in the beginning and 260.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1760.63 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 185.5 MB in the end (delta: 75.2 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18877.46 ms. Allocated memory was 308.3 MB in the beginning and 738.2 MB in the end (delta: 429.9 MB). Free memory was 185.5 MB in the beginning and 318.5 MB in the end (delta: -133.0 MB). Peak memory consumption was 297.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2435.9ms, 126 PlacesBefore, 61 PlacesAfterwards, 115 TransitionsBefore, 49 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 5838 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2324, positive: 2196, positive conditional: 0, positive unconditional: 2196, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1329, positive: 1293, positive conditional: 0, positive unconditional: 1293, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1329, positive: 1293, positive conditional: 0, positive unconditional: 1293, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2324, positive: 903, positive conditional: 0, positive unconditional: 903, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 1329, unknown conditional: 0, unknown unconditional: 1329] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1037.2ms, 57 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 32 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2928 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 725, positive: 590, positive conditional: 0, positive unconditional: 590, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 129, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 725, positive: 490, positive conditional: 0, positive unconditional: 490, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 129, unknown conditional: 0, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1574.0ms, 49 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1086 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 185, positive: 143, positive conditional: 0, positive unconditional: 143, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 185, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.7ms, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 122, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 138.5ms, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 628 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 146, positive conditional: 0, positive unconditional: 146, 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: 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: 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] , Cache Queries: [ total: 166, positive: 145, positive conditional: 0, positive unconditional: 145, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.2ms, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 156, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 156, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 982.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 298, positive: 266, positive conditional: 0, positive unconditional: 266, negative: 32, negative conditional: 0, negative unconditional: 32, 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: 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] , Cache Queries: [ total: 298, positive: 260, positive conditional: 0, positive unconditional: 260, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 944.3ms, 57 PlacesBefore, 57 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.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] , Cache Queries: [ total: 100, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1897.5ms, 65 PlacesBefore, 65 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 268, positive: 220, positive conditional: 0, positive unconditional: 220, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 268, positive: 206, positive conditional: 0, positive unconditional: 206, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1613.4ms, 64 PlacesBefore, 64 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1068 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 162, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1350.6ms, 72 PlacesBefore, 72 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 1416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 2498 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 372, positive: 316, positive conditional: 0, positive unconditional: 316, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 372, positive: 300, positive conditional: 0, positive unconditional: 300, 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): 162, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1033.1ms, 73 PlacesBefore, 69 PlacesAfterwards, 61 TransitionsBefore, 58 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2259 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 448, positive: 382, positive conditional: 0, positive unconditional: 382, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 448, positive: 366, positive conditional: 0, positive unconditional: 366, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 276.4ms, 70 PlacesBefore, 70 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 32 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 209.8ms, 78 PlacesBefore, 78 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18633.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3460.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2517.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 84 SDtfs, 53 SDslu, 51 SDs, 0 SdLazy, 402 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 322.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 353.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.5ms SsaConstructionTime, 379.7ms SatisfiabilityAnalysisTime, 680.5ms InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...