/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:09:24,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:09:24,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:09:24,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:09:24,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:09:24,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:09:24,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:09:24,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:09:24,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:09:24,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:09:24,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:09:24,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:09:24,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:09:24,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:09:24,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:09:24,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:09:24,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:09:24,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:09:24,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:09:24,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:09:24,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:09:24,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:09:24,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:09:24,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:09:24,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:09:24,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:09:24,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:09:24,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:09:24,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:09:24,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:09:24,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:09:24,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:09:24,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:09:24,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:09:24,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:09:24,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:09:24,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:09:24,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:09:24,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:09:24,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:09:24,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:09:24,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:09:24,354 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:09:24,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:09:24,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:09:24,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:09:24,357 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:09:24,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:09:24,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:09:24,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:09:24,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:09:24,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:09:24,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:09:24,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:09:24,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:09:24,359 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:09:24,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:09:24,360 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:09:24,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:09:24,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:09:24,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:09:24,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:09:24,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:09:24,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:09:24,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:09:24,362 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:09:24,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:09:24,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:09:24,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:09:24,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:09:24,643 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:09:24,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_tso.oepc.i [2021-03-25 14:09:24,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e2ac550/2cd6decb6e2e4a1682de2b71978eebdd/FLAG7226643b2 [2021-03-25 14:09:25,287 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:09:25,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_tso.oepc.i [2021-03-25 14:09:25,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e2ac550/2cd6decb6e2e4a1682de2b71978eebdd/FLAG7226643b2 [2021-03-25 14:09:25,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96e2ac550/2cd6decb6e2e4a1682de2b71978eebdd [2021-03-25 14:09:25,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:09:25,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:09:25,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:09:25,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:09:25,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:09:25,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:09:25" (1/1) ... [2021-03-25 14:09:25,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234ebb16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:25, skipping insertion in model container [2021-03-25 14:09:25,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:09:25" (1/1) ... [2021-03-25 14:09:25,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:09:25,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:09:25,923 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/mix001_tso.oepc.i[992,1005] [2021-03-25 14:09:26,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:09:26,089 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:09:26,100 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/mix001_tso.oepc.i[992,1005] [2021-03-25 14:09:26,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:09:26,247 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:09:26,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26 WrapperNode [2021-03-25 14:09:26,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:09:26,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:09:26,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:09:26,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:09:26,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:09:26,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:09:26,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:09:26,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:09:26,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... [2021-03-25 14:09:26,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:09:26,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:09:26,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:09:26,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:09:26,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:09:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:09:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:09:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:09:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:09:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:09:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:09:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:09:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:09:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:09:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:09:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:09:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:09:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:09:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:09:26,395 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:09:28,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:09:28,280 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:09:28,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:09:28 BoogieIcfgContainer [2021-03-25 14:09:28,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:09:28,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:09:28,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:09:28,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:09:28,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:09:25" (1/3) ... [2021-03-25 14:09:28,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21556934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:09:28, skipping insertion in model container [2021-03-25 14:09:28,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:09:26" (2/3) ... [2021-03-25 14:09:28,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21556934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:09:28, skipping insertion in model container [2021-03-25 14:09:28,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:09:28" (3/3) ... [2021-03-25 14:09:28,287 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001_tso.oepc.i [2021-03-25 14:09:28,292 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:09:28,296 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:09:28,297 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:09:28,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,335 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,335 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,338 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:09:28,377 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:09:28,392 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:09:28,409 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:09:28,409 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:09:28,409 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:09:28,409 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:09:28,409 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:09:28,409 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:09:28,409 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:09:28,410 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:09:28,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-03-25 14:09:28,450 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-25 14:09:28,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:09:28,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-03-25 14:09:28,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-03-25 14:09:28,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-03-25 14:09:28,460 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:28,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-25 14:09:28,473 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-25 14:09:28,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2021-03-25 14:09:28,492 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-25 14:09:28,492 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:09:28,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-03-25 14:09:28,496 INFO L142 LiptonReduction]: Number of co-enabled transitions 1974 [2021-03-25 14:09:29,339 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:09:29,705 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:09:29,827 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:09:31,101 INFO L154 LiptonReduction]: Checked pairs total: 4492 [2021-03-25 14:09:31,101 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-25 14:09:31,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2644 [2021-03-25 14:09:31,114 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 14:09:31,115 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:09:31,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:31,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:31,116 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:31,122 INFO L82 PathProgramCache]: Analyzing trace with hash 991359524, now seen corresponding path program 1 times [2021-03-25 14:09:31,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:31,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674413884] [2021-03-25 14:09:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:31,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:31,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:31,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:31,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:31,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674413884] [2021-03-25 14:09:31,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:31,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:09:31,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805685487] [2021-03-25 14:09:31,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:09:31,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:09:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:09:31,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 171 [2021-03-25 14:09:31,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:31,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:31,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 171 [2021-03-25 14:09:31,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:31,551 INFO L129 PetriNetUnfolder]: 69/214 cut-off events. [2021-03-25 14:09:31,551 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:09:31,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 214 events. 69/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1056 event pairs, 58 based on Foata normal form. 41/242 useless extension candidates. Maximal degree in co-relation 321. Up to 97 conditions per place. [2021-03-25 14:09:31,556 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-25 14:09:31,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 123 flow [2021-03-25 14:09:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:09:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:09:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2021-03-25 14:09:31,573 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9044834307992202 [2021-03-25 14:09:31,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2021-03-25 14:09:31,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2021-03-25 14:09:31,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:31,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2021-03-25 14:09:31,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:31,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:31,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:31,591 INFO L185 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 464 transitions. [2021-03-25 14:09:31,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 123 flow [2021-03-25 14:09:31,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:09:31,594 INFO L241 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2021-03-25 14:09:31,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2021-03-25 14:09:31,596 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2021-03-25 14:09:31,597 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:31,597 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 92 flow [2021-03-25 14:09:31,598 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 92 flow [2021-03-25 14:09:31,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 92 flow [2021-03-25 14:09:31,605 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 14:09:31,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:09:31,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:09:31,606 INFO L142 LiptonReduction]: Number of co-enabled transitions 480 [2021-03-25 14:09:32,369 INFO L154 LiptonReduction]: Checked pairs total: 1554 [2021-03-25 14:09:32,370 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:09:32,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 773 [2021-03-25 14:09:32,371 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2021-03-25 14:09:32,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:32,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:32,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:32,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:09:32,372 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash 822846928, now seen corresponding path program 1 times [2021-03-25 14:09:32,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:32,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481019172] [2021-03-25 14:09:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:32,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:32,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:32,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:32,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:32,469 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:09:32,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:09:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:32,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481019172] [2021-03-25 14:09:32,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:32,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:09:32,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578309614] [2021-03-25 14:09:32,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:09:32,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:09:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:09:32,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 183 [2021-03-25 14:09:32,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:32,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:32,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 183 [2021-03-25 14:09:32,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:32,516 INFO L129 PetriNetUnfolder]: 1/33 cut-off events. [2021-03-25 14:09:32,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:09:32,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2021-03-25 14:09:32,517 INFO L132 encePairwiseOnDemand]: 179/183 looper letters, 1 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-03-25 14:09:32,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 86 flow [2021-03-25 14:09:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:09:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:09:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 802 transitions. [2021-03-25 14:09:32,520 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8765027322404372 [2021-03-25 14:09:32,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 802 transitions. [2021-03-25 14:09:32,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 802 transitions. [2021-03-25 14:09:32,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:32,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 802 transitions. [2021-03-25 14:09:32,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.4) internal successors, (802), 5 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:32,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:32,525 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:32,525 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 5 states and 802 transitions. [2021-03-25 14:09:32,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 86 flow [2021-03-25 14:09:32,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:09:32,526 INFO L241 Difference]: Finished difference. Result has 42 places, 27 transitions, 68 flow [2021-03-25 14:09:32,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2021-03-25 14:09:32,527 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2021-03-25 14:09:32,527 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:32,527 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 68 flow [2021-03-25 14:09:32,527 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 68 flow [2021-03-25 14:09:32,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 68 flow [2021-03-25 14:09:32,530 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 14:09:32,531 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:09:32,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 0/27 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:09:32,531 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-25 14:09:33,274 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:09:33,433 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:09:33,771 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:09:33,949 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:09:33,953 INFO L154 LiptonReduction]: Checked pairs total: 1158 [2021-03-25 14:09:33,953 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:09:33,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1426 [2021-03-25 14:09:33,954 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 62 flow [2021-03-25 14:09:33,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:33,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:33,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:33,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:09:33,955 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash 624594535, now seen corresponding path program 1 times [2021-03-25 14:09:33,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:33,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049271126] [2021-03-25 14:09:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:34,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:34,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:34,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049271126] [2021-03-25 14:09:34,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:34,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:09:34,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376799606] [2021-03-25 14:09:34,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:09:34,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:34,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:09:34,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:09:34,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 186 [2021-03-25 14:09:34,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:34,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 186 [2021-03-25 14:09:34,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:34,060 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:09:34,060 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:09:34,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 24 events. 0/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:09:34,060 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-25 14:09:34,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 68 flow [2021-03-25 14:09:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:09:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:09:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2021-03-25 14:09:34,062 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8942652329749103 [2021-03-25 14:09:34,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2021-03-25 14:09:34,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2021-03-25 14:09:34,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:34,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2021-03-25 14:09:34,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,065 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 62 flow. Second operand 3 states and 499 transitions. [2021-03-25 14:09:34,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 68 flow [2021-03-25 14:09:34,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:09:34,066 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 66 flow [2021-03-25 14:09:34,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-25 14:09:34,067 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2021-03-25 14:09:34,067 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:34,067 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 66 flow [2021-03-25 14:09:34,067 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 66 flow [2021-03-25 14:09:34,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 66 flow [2021-03-25 14:09:34,072 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:09:34,072 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:09:34,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:09:34,072 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-25 14:09:34,102 INFO L154 LiptonReduction]: Checked pairs total: 687 [2021-03-25 14:09:34,102 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:09:34,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-25 14:09:34,104 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2021-03-25 14:09:34,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:34,104 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:34,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:09:34,105 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1838943604, now seen corresponding path program 1 times [2021-03-25 14:09:34,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:34,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264680346] [2021-03-25 14:09:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:34,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,183 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:09:34,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:09:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:34,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264680346] [2021-03-25 14:09:34,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:34,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:09:34,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860980768] [2021-03-25 14:09:34,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:09:34,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:34,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:09:34,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:09:34,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 187 [2021-03-25 14:09:34,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:34,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 187 [2021-03-25 14:09:34,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:34,244 INFO L129 PetriNetUnfolder]: 40/112 cut-off events. [2021-03-25 14:09:34,244 INFO L130 PetriNetUnfolder]: For 45/53 co-relation queries the response was YES. [2021-03-25 14:09:34,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 112 events. 40/112 cut-off events. For 45/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 440 event pairs, 8 based on Foata normal form. 6/114 useless extension candidates. Maximal degree in co-relation 231. Up to 63 conditions per place. [2021-03-25 14:09:34,246 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 10 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2021-03-25 14:09:34,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 100 flow [2021-03-25 14:09:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:09:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:09:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-03-25 14:09:34,252 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8413547237076648 [2021-03-25 14:09:34,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-03-25 14:09:34,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-03-25 14:09:34,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:34,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-03-25 14:09:34,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,259 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 3 states and 472 transitions. [2021-03-25 14:09:34,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 100 flow [2021-03-25 14:09:34,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:09:34,262 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 68 flow [2021-03-25 14:09:34,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-03-25 14:09:34,262 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2021-03-25 14:09:34,262 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:34,262 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 68 flow [2021-03-25 14:09:34,263 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 68 flow [2021-03-25 14:09:34,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 68 flow [2021-03-25 14:09:34,269 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 14:09:34,269 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:09:34,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 23 events. 0/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:09:34,269 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:09:34,299 INFO L154 LiptonReduction]: Checked pairs total: 585 [2021-03-25 14:09:34,299 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:09:34,299 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:09:34,300 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 66 flow [2021-03-25 14:09:34,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:34,300 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:34,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:09:34,301 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash -249100518, now seen corresponding path program 1 times [2021-03-25 14:09:34,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:34,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451167784] [2021-03-25 14:09:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:34,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,372 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:09:34,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:09:34,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:34,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451167784] [2021-03-25 14:09:34,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:34,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:09:34,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593787084] [2021-03-25 14:09:34,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:09:34,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:09:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:09:34,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 188 [2021-03-25 14:09:34,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:34,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 188 [2021-03-25 14:09:34,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:34,422 INFO L129 PetriNetUnfolder]: 28/80 cut-off events. [2021-03-25 14:09:34,423 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-03-25 14:09:34,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 80 events. 28/80 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 280 event pairs, 12 based on Foata normal form. 8/87 useless extension candidates. Maximal degree in co-relation 164. Up to 45 conditions per place. [2021-03-25 14:09:34,423 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 4 changer transitions 7/32 dead transitions. [2021-03-25 14:09:34,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 118 flow [2021-03-25 14:09:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:09:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:09:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions. [2021-03-25 14:09:34,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8542553191489362 [2021-03-25 14:09:34,426 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 803 transitions. [2021-03-25 14:09:34,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions. [2021-03-25 14:09:34,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:34,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions. [2021-03-25 14:09:34,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 188.0) internal successors, (1128), 6 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,431 INFO L185 Difference]: Start difference. First operand has 34 places, 22 transitions, 66 flow. Second operand 5 states and 803 transitions. [2021-03-25 14:09:34,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 118 flow [2021-03-25 14:09:34,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:09:34,432 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 98 flow [2021-03-25 14:09:34,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-25 14:09:34,433 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -14 predicate places. [2021-03-25 14:09:34,433 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:34,433 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 98 flow [2021-03-25 14:09:34,433 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 98 flow [2021-03-25 14:09:34,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 98 flow [2021-03-25 14:09:34,441 INFO L129 PetriNetUnfolder]: 23/67 cut-off events. [2021-03-25 14:09:34,441 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2021-03-25 14:09:34,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 67 events. 23/67 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 219 event pairs, 11 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 174. Up to 38 conditions per place. [2021-03-25 14:09:34,442 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-25 14:09:34,448 INFO L154 LiptonReduction]: Checked pairs total: 237 [2021-03-25 14:09:34,448 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:09:34,448 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 14:09:34,449 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 98 flow [2021-03-25 14:09:34,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:34,450 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:34,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:09:34,450 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:34,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1605811905, now seen corresponding path program 1 times [2021-03-25 14:09:34,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:34,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786611833] [2021-03-25 14:09:34,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:34,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:34,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:34,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786611833] [2021-03-25 14:09:34,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:34,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:09:34,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332620085] [2021-03-25 14:09:34,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:09:34,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:34,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:09:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:09:34,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2021-03-25 14:09:34,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:34,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2021-03-25 14:09:34,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:34,574 INFO L129 PetriNetUnfolder]: 48/127 cut-off events. [2021-03-25 14:09:34,574 INFO L130 PetriNetUnfolder]: For 164/173 co-relation queries the response was YES. [2021-03-25 14:09:34,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 127 events. 48/127 cut-off events. For 164/173 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 571 event pairs, 23 based on Foata normal form. 10/129 useless extension candidates. Maximal degree in co-relation 347. Up to 78 conditions per place. [2021-03-25 14:09:34,576 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 3 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-25 14:09:34,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 26 transitions, 110 flow [2021-03-25 14:09:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:09:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:09:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-25 14:09:34,578 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.848404255319149 [2021-03-25 14:09:34,578 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-25 14:09:34,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-25 14:09:34,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:34,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-25 14:09:34,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,581 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,581 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 98 flow. Second operand 4 states and 638 transitions. [2021-03-25 14:09:34,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 26 transitions, 110 flow [2021-03-25 14:09:34,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 104 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:09:34,583 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 105 flow [2021-03-25 14:09:34,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-25 14:09:34,583 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -13 predicate places. [2021-03-25 14:09:34,583 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:34,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 105 flow [2021-03-25 14:09:34,583 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 105 flow [2021-03-25 14:09:34,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 105 flow [2021-03-25 14:09:34,600 INFO L129 PetriNetUnfolder]: 48/127 cut-off events. [2021-03-25 14:09:34,600 INFO L130 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2021-03-25 14:09:34,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 127 events. 48/127 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 584 event pairs, 23 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 333. Up to 78 conditions per place. [2021-03-25 14:09:34,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-25 14:09:34,608 INFO L154 LiptonReduction]: Checked pairs total: 239 [2021-03-25 14:09:34,608 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:09:34,608 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-25 14:09:34,610 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 105 flow [2021-03-25 14:09:34,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,611 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:34,611 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:34,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:09:34,611 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash -276940365, now seen corresponding path program 2 times [2021-03-25 14:09:34,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:34,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886741475] [2021-03-25 14:09:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:34,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,706 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:09:34,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:09:34,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:34,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886741475] [2021-03-25 14:09:34,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:34,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:09:34,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136189455] [2021-03-25 14:09:34,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:09:34,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:09:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:09:34,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 188 [2021-03-25 14:09:34,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:34,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 188 [2021-03-25 14:09:34,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:34,766 INFO L129 PetriNetUnfolder]: 32/103 cut-off events. [2021-03-25 14:09:34,766 INFO L130 PetriNetUnfolder]: For 86/96 co-relation queries the response was YES. [2021-03-25 14:09:34,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 103 events. 32/103 cut-off events. For 86/96 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 423 event pairs, 4 based on Foata normal form. 19/117 useless extension candidates. Maximal degree in co-relation 335. Up to 68 conditions per place. [2021-03-25 14:09:34,767 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 5 selfloop transitions, 7 changer transitions 7/36 dead transitions. [2021-03-25 14:09:34,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 201 flow [2021-03-25 14:09:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:09:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:09:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2021-03-25 14:09:34,772 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8537234042553191 [2021-03-25 14:09:34,772 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 963 transitions. [2021-03-25 14:09:34,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 963 transitions. [2021-03-25 14:09:34,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:34,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 963 transitions. [2021-03-25 14:09:34,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,777 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,777 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 105 flow. Second operand 6 states and 963 transitions. [2021-03-25 14:09:34,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 201 flow [2021-03-25 14:09:34,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:09:34,782 INFO L241 Difference]: Finished difference. Result has 47 places, 29 transitions, 160 flow [2021-03-25 14:09:34,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2021-03-25 14:09:34,782 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2021-03-25 14:09:34,782 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:34,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 29 transitions, 160 flow [2021-03-25 14:09:34,783 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 29 transitions, 160 flow [2021-03-25 14:09:34,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 29 transitions, 160 flow [2021-03-25 14:09:34,795 INFO L129 PetriNetUnfolder]: 22/80 cut-off events. [2021-03-25 14:09:34,796 INFO L130 PetriNetUnfolder]: For 146/152 co-relation queries the response was YES. [2021-03-25 14:09:34,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 80 events. 22/80 cut-off events. For 146/152 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 4 based on Foata normal form. 3/80 useless extension candidates. Maximal degree in co-relation 287. Up to 45 conditions per place. [2021-03-25 14:09:34,797 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-25 14:09:34,799 INFO L154 LiptonReduction]: Checked pairs total: 271 [2021-03-25 14:09:34,799 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:09:34,799 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 14:09:34,800 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 160 flow [2021-03-25 14:09:34,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:34,801 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:34,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:09:34,801 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash -325782751, now seen corresponding path program 1 times [2021-03-25 14:09:34,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:34,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273200969] [2021-03-25 14:09:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:34,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:34,916 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:09:34,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:09:34,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:34,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:34,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273200969] [2021-03-25 14:09:34,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:34,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:09:34,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61035586] [2021-03-25 14:09:34,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:09:34,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:34,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:09:34,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:09:34,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 188 [2021-03-25 14:09:34,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:34,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 188 [2021-03-25 14:09:34,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:34,983 INFO L129 PetriNetUnfolder]: 14/61 cut-off events. [2021-03-25 14:09:34,983 INFO L130 PetriNetUnfolder]: For 132/152 co-relation queries the response was YES. [2021-03-25 14:09:34,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 61 events. 14/61 cut-off events. For 132/152 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 179 event pairs, 0 based on Foata normal form. 20/78 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2021-03-25 14:09:34,984 INFO L132 encePairwiseOnDemand]: 182/188 looper letters, 2 selfloop transitions, 10 changer transitions 5/33 dead transitions. [2021-03-25 14:09:34,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 33 transitions, 228 flow [2021-03-25 14:09:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:09:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:09:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2021-03-25 14:09:34,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8487841945288754 [2021-03-25 14:09:34,986 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2021-03-25 14:09:34,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2021-03-25 14:09:34,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:34,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2021-03-25 14:09:34,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.57142857142858) internal successors, (1117), 7 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,993 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:34,993 INFO L185 Difference]: Start difference. First operand has 45 places, 29 transitions, 160 flow. Second operand 7 states and 1117 transitions. [2021-03-25 14:09:34,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 33 transitions, 228 flow [2021-03-25 14:09:34,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 180 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-03-25 14:09:34,996 INFO L241 Difference]: Finished difference. Result has 47 places, 28 transitions, 144 flow [2021-03-25 14:09:34,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2021-03-25 14:09:34,996 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2021-03-25 14:09:34,997 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:34,997 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 28 transitions, 144 flow [2021-03-25 14:09:34,997 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 28 transitions, 144 flow [2021-03-25 14:09:34,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 144 flow [2021-03-25 14:09:35,003 INFO L129 PetriNetUnfolder]: 6/37 cut-off events. [2021-03-25 14:09:35,003 INFO L130 PetriNetUnfolder]: For 38/40 co-relation queries the response was YES. [2021-03-25 14:09:35,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 37 events. 6/37 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 96. Up to 13 conditions per place. [2021-03-25 14:09:35,004 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-25 14:09:35,257 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:09:35,363 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:09:35,687 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 14:09:35,831 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 14:09:35,838 INFO L154 LiptonReduction]: Checked pairs total: 518 [2021-03-25 14:09:35,838 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:09:35,838 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 841 [2021-03-25 14:09:35,839 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 138 flow [2021-03-25 14:09:35,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:35,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:35,839 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 14:09:35,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:09:35,839 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -485519335, now seen corresponding path program 1 times [2021-03-25 14:09:35,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:35,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542451566] [2021-03-25 14:09:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:35,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:35,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:09:35,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:35,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:35,891 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:09:35,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:09:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:35,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542451566] [2021-03-25 14:09:35,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:35,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:09:35,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306560167] [2021-03-25 14:09:35,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:09:35,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:09:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:09:35,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 191 [2021-03-25 14:09:35,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:35,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:35,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 191 [2021-03-25 14:09:35,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:35,959 INFO L129 PetriNetUnfolder]: 27/103 cut-off events. [2021-03-25 14:09:35,960 INFO L130 PetriNetUnfolder]: For 273/291 co-relation queries the response was YES. [2021-03-25 14:09:35,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 103 events. 27/103 cut-off events. For 273/291 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 438 event pairs, 0 based on Foata normal form. 12/112 useless extension candidates. Maximal degree in co-relation 282. Up to 30 conditions per place. [2021-03-25 14:09:35,960 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 6 selfloop transitions, 6 changer transitions 3/33 dead transitions. [2021-03-25 14:09:35,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 190 flow [2021-03-25 14:09:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:09:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:09:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 751 transitions. [2021-03-25 14:09:35,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7863874345549738 [2021-03-25 14:09:35,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 751 transitions. [2021-03-25 14:09:35,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 751 transitions. [2021-03-25 14:09:35,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:35,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 751 transitions. [2021-03-25 14:09:35,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:35,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:35,967 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:35,967 INFO L185 Difference]: Start difference. First operand has 41 places, 25 transitions, 138 flow. Second operand 5 states and 751 transitions. [2021-03-25 14:09:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 190 flow [2021-03-25 14:09:35,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 150 flow, removed 13 selfloop flow, removed 7 redundant places. [2021-03-25 14:09:35,969 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 141 flow [2021-03-25 14:09:35,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-25 14:09:35,969 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2021-03-25 14:09:35,970 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:35,970 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 141 flow [2021-03-25 14:09:35,970 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 141 flow [2021-03-25 14:09:35,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 141 flow [2021-03-25 14:09:35,981 INFO L129 PetriNetUnfolder]: 19/88 cut-off events. [2021-03-25 14:09:35,981 INFO L130 PetriNetUnfolder]: For 75/76 co-relation queries the response was YES. [2021-03-25 14:09:35,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 88 events. 19/88 cut-off events. For 75/76 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 355 event pairs, 2 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 218. Up to 22 conditions per place. [2021-03-25 14:09:35,982 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-25 14:09:35,984 INFO L154 LiptonReduction]: Checked pairs total: 156 [2021-03-25 14:09:35,984 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:09:35,984 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-25 14:09:35,984 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 141 flow [2021-03-25 14:09:35,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:35,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:35,985 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:35,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:09:35,985 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -32418347, now seen corresponding path program 1 times [2021-03-25 14:09:35,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:35,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364383235] [2021-03-25 14:09:35,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:09:36,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:36,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:09:36,118 INFO L142 QuantifierPusher]: treesize reduction 15, result has 68.8 percent of original size [2021-03-25 14:09:36,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:09:36,150 INFO L142 QuantifierPusher]: treesize reduction 7, result has 92.6 percent of original size [2021-03-25 14:09:36,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-03-25 14:09:36,207 INFO L142 QuantifierPusher]: treesize reduction 12, result has 79.3 percent of original size [2021-03-25 14:09:36,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 14:09:36,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:36,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:09:36,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:09:36,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:09:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:09:36,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364383235] [2021-03-25 14:09:36,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:09:36,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:09:36,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975792521] [2021-03-25 14:09:36,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:09:36,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:09:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:09:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:09:36,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 191 [2021-03-25 14:09:36,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:36,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:09:36,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 191 [2021-03-25 14:09:36,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:09:36,443 INFO L129 PetriNetUnfolder]: 93/266 cut-off events. [2021-03-25 14:09:36,443 INFO L130 PetriNetUnfolder]: For 365/392 co-relation queries the response was YES. [2021-03-25 14:09:36,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 266 events. 93/266 cut-off events. For 365/392 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1537 event pairs, 9 based on Foata normal form. 20/275 useless extension candidates. Maximal degree in co-relation 718. Up to 71 conditions per place. [2021-03-25 14:09:36,445 INFO L132 encePairwiseOnDemand]: 184/191 looper letters, 9 selfloop transitions, 7 changer transitions 13/48 dead transitions. [2021-03-25 14:09:36,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 269 flow [2021-03-25 14:09:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:09:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:09:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1113 transitions. [2021-03-25 14:09:36,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7284031413612565 [2021-03-25 14:09:36,448 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1113 transitions. [2021-03-25 14:09:36,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1113 transitions. [2021-03-25 14:09:36,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:09:36,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1113 transitions. [2021-03-25 14:09:36,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.125) internal successors, (1113), 8 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:36,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:36,453 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:36,453 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 141 flow. Second operand 8 states and 1113 transitions. [2021-03-25 14:09:36,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 269 flow [2021-03-25 14:09:36,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:09:36,457 INFO L241 Difference]: Finished difference. Result has 51 places, 31 transitions, 184 flow [2021-03-25 14:09:36,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2021-03-25 14:09:36,457 INFO L343 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2021-03-25 14:09:36,457 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:09:36,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 31 transitions, 184 flow [2021-03-25 14:09:36,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 31 transitions, 184 flow [2021-03-25 14:09:36,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 184 flow [2021-03-25 14:09:36,501 INFO L129 PetriNetUnfolder]: 40/146 cut-off events. [2021-03-25 14:09:36,501 INFO L130 PetriNetUnfolder]: For 240/244 co-relation queries the response was YES. [2021-03-25 14:09:36,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 146 events. 40/146 cut-off events. For 240/244 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 729 event pairs, 6 based on Foata normal form. 4/145 useless extension candidates. Maximal degree in co-relation 419. Up to 41 conditions per place. [2021-03-25 14:09:36,503 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-25 14:09:36,506 INFO L154 LiptonReduction]: Checked pairs total: 39 [2021-03-25 14:09:36,506 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:09:36,506 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-25 14:09:36,506 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 184 flow [2021-03-25 14:09:36,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:09:36,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:09:36,507 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:09:36,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:09:36,507 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:09:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:09:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -387798395, now seen corresponding path program 2 times [2021-03-25 14:09:36,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:09:36,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372241804] [2021-03-25 14:09:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:09:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:09:36,570 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:09:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:09:36,627 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:09:36,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:09:36,654 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:09:36,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:09:36,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:09:36 BasicIcfg [2021-03-25 14:09:36,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:09:36,729 INFO L168 Benchmark]: Toolchain (without parser) took 11010.79 ms. Allocated memory was 255.9 MB in the beginning and 557.8 MB in the end (delta: 302.0 MB). Free memory was 232.3 MB in the beginning and 458.1 MB in the end (delta: -225.8 MB). Peak memory consumption was 76.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:09:36,729 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:09:36,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.76 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 232.3 MB in the beginning and 295.4 MB in the end (delta: -63.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:09:36,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.61 ms. Allocated memory is still 337.6 MB. Free memory was 294.9 MB in the beginning and 292.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:09:36,729 INFO L168 Benchmark]: Boogie Preprocessor took 31.86 ms. Allocated memory is still 337.6 MB. Free memory was 292.3 MB in the beginning and 289.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:09:36,730 INFO L168 Benchmark]: RCFGBuilder took 1953.93 ms. Allocated memory is still 337.6 MB. Free memory was 289.6 MB in the beginning and 206.2 MB in the end (delta: 83.4 MB). Peak memory consumption was 91.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:09:36,730 INFO L168 Benchmark]: TraceAbstraction took 8445.13 ms. Allocated memory was 337.6 MB in the beginning and 557.8 MB in the end (delta: 220.2 MB). Free memory was 206.2 MB in the beginning and 458.1 MB in the end (delta: -251.8 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:09:36,731 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 528.76 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 232.3 MB in the beginning and 295.4 MB in the end (delta: -63.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.61 ms. Allocated memory is still 337.6 MB. Free memory was 294.9 MB in the beginning and 292.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.86 ms. Allocated memory is still 337.6 MB. Free memory was 292.3 MB in the beginning and 289.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1953.93 ms. Allocated memory is still 337.6 MB. Free memory was 289.6 MB in the beginning and 206.2 MB in the end (delta: 83.4 MB). Peak memory consumption was 91.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8445.13 ms. Allocated memory was 337.6 MB in the beginning and 557.8 MB in the end (delta: 220.2 MB). Free memory was 206.2 MB in the beginning and 458.1 MB in the end (delta: -251.8 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2628.0ms, 110 PlacesBefore, 53 PlacesAfterwards, 102 TransitionsBefore, 45 TransitionsAfterwards, 1974 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 66 TotalNumberOfCompositions, 4492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1665, positive: 1544, positive conditional: 0, positive unconditional: 1544, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1178, positive: 1137, positive conditional: 0, positive unconditional: 1137, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1178, positive: 1137, positive conditional: 0, positive unconditional: 1137, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1178, positive: 1134, positive conditional: 0, positive unconditional: 1134, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 390, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 384, negative conditional: 0, negative unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1665, positive: 407, positive conditional: 0, positive unconditional: 407, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 1178, unknown conditional: 0, unknown unconditional: 1178] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 771.9ms, 50 PlacesBefore, 39 PlacesAfterwards, 41 TransitionsBefore, 30 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1554 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 367, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 82, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 367, positive: 216, positive conditional: 0, positive unconditional: 216, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1425.5ms, 42 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 24 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 447, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 447, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.5ms, 35 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 260, positive: 214, positive conditional: 0, positive unconditional: 214, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, positive: 206, positive conditional: 0, positive unconditional: 206, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.0ms, 35 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 585 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 168, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.1ms, 39 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 15, negative conditional: 0, negative unconditional: 15, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 239 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.9ms, 47 PlacesBefore, 45 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 271 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 840.9ms, 47 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 518 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.0ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.3ms, 51 PlacesBefore, 49 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 39 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t32; [L865] FCALL, FORK 0 pthread_create(&t32, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L19] COND FALSE 1 !(!expression) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1 [L768] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t33; [L867] FCALL, FORK 0 pthread_create(&t33, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 2 x = 1 [L800] 2 __unbuffered_p1_EAX = x [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t34; [L869] FCALL, FORK 0 pthread_create(&t34, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 y = 1 [L823] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L831] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L832] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L833] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L834] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L835] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L835] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L836] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L842] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L842] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L806] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L806] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L806] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 2 return 0; [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L875] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8249.2ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 800.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2700.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 19 SDslu, 21 SDs, 0 SdLazy, 222 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 277.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 262.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=10, InterpolantAutomatonStates: 49, 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: 39.3ms SsaConstructionTime, 425.5ms SatisfiabilityAnalysisTime, 769.3ms InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...