/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:17:09,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:17:09,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:17:09,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:17:09,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:17:09,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:17:09,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:17:09,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:17:09,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:17:09,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:17:09,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:17:09,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:17:09,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:17:09,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:17:09,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:17:09,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:17:09,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:17:09,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:17:09,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:17:09,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:17:09,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:17:09,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:17:09,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:17:09,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:17:09,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:17:09,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:17:09,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:17:09,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:17:09,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:17:09,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:17:09,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:17:09,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:17:09,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:17:09,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:17:09,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:17:09,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:17:09,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:17:09,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:17:09,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:17:09,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:17:09,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:17:09,590 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 16:17:09,621 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:17:09,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:17:09,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:17:09,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:17:09,624 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:17:09,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:17:09,624 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:17:09,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:17:09,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:17:09,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:17:09,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:17:09,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:17:09,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:17:09,625 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:17:09,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:17:09,626 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:17:09,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:17:09,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:17:09,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:17:09,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:17:09,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:17:09,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:17:09,627 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:17:09,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:17:09,628 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-06-11 16:17:09,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:17:09,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:17:09,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:17:09,942 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:17:09,943 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:17:09,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2021-06-11 16:17:10,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12d91d6f/3b73320198fe415aaa0aff267a3680b5/FLAG8c149c1f8 [2021-06-11 16:17:10,528 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:17:10,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2021-06-11 16:17:10,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12d91d6f/3b73320198fe415aaa0aff267a3680b5/FLAG8c149c1f8 [2021-06-11 16:17:10,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12d91d6f/3b73320198fe415aaa0aff267a3680b5 [2021-06-11 16:17:10,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:17:10,844 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:17:10,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:17:10,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:17:10,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:17:10,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:17:10" (1/1) ... [2021-06-11 16:17:10,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dead921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:10, skipping insertion in model container [2021-06-11 16:17:10,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:17:10" (1/1) ... [2021-06-11 16:17:10,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:17:10,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:17:11,031 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/safe019_power.oepc.i[995,1008] [2021-06-11 16:17:11,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:17:11,220 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:17:11,229 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/safe019_power.oepc.i[995,1008] [2021-06-11 16:17:11,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:17:11,386 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:17:11,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11 WrapperNode [2021-06-11 16:17:11,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:17:11,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:17:11,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:17:11,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:17:11,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:17:11,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:17:11,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:17:11,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:17:11,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (1/1) ... [2021-06-11 16:17:11,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:17:11,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:17:11,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:17:11,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:17:11,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (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-06-11 16:17:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-11 16:17:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:17:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:17:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:17:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:17:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:17:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:17:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:17:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:17:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:17:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:17:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 16:17:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 16:17:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:17:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:17:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:17:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:17:11,608 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:17:14,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:17:14,292 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-06-11 16:17:14,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:17:14 BoogieIcfgContainer [2021-06-11 16:17:14,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:17:14,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:17:14,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:17:14,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:17:14,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:17:10" (1/3) ... [2021-06-11 16:17:14,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698dcf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:17:14, skipping insertion in model container [2021-06-11 16:17:14,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:17:11" (2/3) ... [2021-06-11 16:17:14,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698dcf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:17:14, skipping insertion in model container [2021-06-11 16:17:14,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:17:14" (3/3) ... [2021-06-11 16:17:14,301 INFO L111 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2021-06-11 16:17:14,307 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:17:14,310 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 16:17:14,311 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:17:14,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,369 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,370 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,414 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,434 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:17:14,435 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:17:14,450 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 16:17:14,476 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:17:14,476 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:17:14,476 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:17:14,476 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:17:14,476 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:17:14,477 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:17:14,477 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:17:14,477 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:17:14,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-06-11 16:17:14,542 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-06-11 16:17:14,542 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:14,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-06-11 16:17:14,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-06-11 16:17:14,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 111 transitions, 234 flow [2021-06-11 16:17:14,562 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:14,577 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 111 transitions, 234 flow [2021-06-11 16:17:14,580 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 111 transitions, 234 flow [2021-06-11 16:17:14,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 111 transitions, 234 flow [2021-06-11 16:17:14,620 INFO L129 PetriNetUnfolder]: 1/111 cut-off events. [2021-06-11 16:17:14,620 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:14,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 1/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-06-11 16:17:14,625 INFO L151 LiptonReduction]: Number of co-enabled transitions 1430 [2021-06-11 16:17:14,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:14,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:14,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:14,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:14,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:14,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:14,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:14,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:14,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:14,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:14,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:15,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:15,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:15,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:15,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:21,068 WARN L205 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 406 DAG size of output: 363 [2021-06-11 16:17:21,924 WARN L205 SmtUtils]: Spent 851.00 ms on a formula simplification that was a NOOP. DAG size: 360 [2021-06-11 16:17:25,643 WARN L205 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-06-11 16:17:27,458 WARN L205 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 528 [2021-06-11 16:17:27,520 INFO L142 QuantifierPusher]: treesize reduction 326, result has 81.5 percent of original size [2021-06-11 16:17:27,551 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-06-11 16:17:27,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 163 [2021-06-11 16:17:27,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,582 INFO L142 QuantifierPusher]: treesize reduction 22, result has 89.5 percent of original size [2021-06-11 16:17:27,589 INFO L147 QuantifierPusher]: treesize reduction 48, result has 46.1 percent of original size 41 [2021-06-11 16:17:27,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,593 INFO L142 QuantifierPusher]: treesize reduction 22, result has 87.6 percent of original size [2021-06-11 16:17:27,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-06-11 16:17:27,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,600 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,627 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,632 INFO L142 QuantifierPusher]: treesize reduction 67, result has 80.5 percent of original size [2021-06-11 16:17:27,633 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,635 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,638 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,640 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,642 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,643 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,645 INFO L142 QuantifierPusher]: treesize reduction 4, result has 96.0 percent of original size [2021-06-11 16:17:27,646 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-06-11 16:17:27,647 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 148 [2021-06-11 16:17:27,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 186 [2021-06-11 16:17:27,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 198 [2021-06-11 16:17:27,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 217 [2021-06-11 16:17:27,672 INFO L147 QuantifierPusher]: treesize reduction 8, result has 97.6 percent of original size 329 [2021-06-11 16:17:27,675 INFO L147 QuantifierPusher]: treesize reduction 8, result has 97.6 percent of original size 329 [2021-06-11 16:17:27,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,678 INFO L142 QuantifierPusher]: treesize reduction 48, result has 76.4 percent of original size [2021-06-11 16:17:27,679 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-06-11 16:17:27,679 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,681 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,681 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-06-11 16:17:27,681 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,683 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,683 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 2, 2, 3, 2, 3, 2, 1] term [2021-06-11 16:17:27,684 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,685 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,686 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2021-06-11 16:17:27,686 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,687 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,688 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 3, 2, 1] term [2021-06-11 16:17:27,688 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,689 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,691 INFO L147 QuantifierPusher]: treesize reduction 241, result has 25.2 percent of original size 81 [2021-06-11 16:17:27,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,695 INFO L142 QuantifierPusher]: treesize reduction 241, result has 44.7 percent of original size [2021-06-11 16:17:27,695 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 16:17:27,695 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,697 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,698 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 2, 3, 3, 3, 2, 1] term [2021-06-11 16:17:27,698 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,699 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,700 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 3, 2, 3, 3, 2, 1] term [2021-06-11 16:17:27,700 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,701 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,702 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 2, 2, 3, 2, 1] term [2021-06-11 16:17:27,703 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,704 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,704 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 2, 2, 3, 2, 1] term [2021-06-11 16:17:27,705 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,706 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,708 INFO L147 QuantifierPusher]: treesize reduction 293, result has 12.3 percent of original size 41 [2021-06-11 16:17:27,709 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 3, 4, 3, 3, 3, 2, 2, 2, 3, 2, 1] term [2021-06-11 16:17:27,709 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:27,711 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 175 [2021-06-11 16:17:27,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,734 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:27,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,738 INFO L147 QuantifierPusher]: treesize reduction 41, result has 46.1 percent of original size 35 [2021-06-11 16:17:27,744 INFO L147 QuantifierPusher]: treesize reduction 442, result has 47.1 percent of original size 393 [2021-06-11 16:17:27,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:27,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:27,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:29,031 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2021-06-11 16:17:29,452 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-06-11 16:17:31,214 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 370 DAG size of output: 326 [2021-06-11 16:17:32,082 WARN L205 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 323 [2021-06-11 16:17:32,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:32,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:32,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:32,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:32,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:32,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:32,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:32,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:32,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:33,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:33,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:33,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:33,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:33,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:33,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:33,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:33,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:33,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:33,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:34,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:34,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:34,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:34,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:34,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:34,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:34,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:34,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:34,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:34,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:34,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 16:17:34,600 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-06-11 16:17:34,990 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-06-11 16:17:35,864 WARN L205 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2021-06-11 16:17:36,683 WARN L205 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2021-06-11 16:17:36,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:36,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:36,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:36,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:36,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:36,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:36,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:36,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:36,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:36,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:36,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:37,361 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2021-06-11 16:17:37,825 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2021-06-11 16:17:37,979 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-11 16:17:37,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:37,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:17:37,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:37,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,995 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 16:17:37,995 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:37,997 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:37,998 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 16:17:37,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:37,999 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 16:17:37,999 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 16:17:38,000 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:38,001 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:38,002 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 16:17:38,003 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 16:17:38,003 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:38,004 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:38,006 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 16:17:38,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:38,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:38,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:38,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:39,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:39,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:39,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:39,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:17:39,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:17:39,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:39,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:39,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:17:39,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:17:39,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:39,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:39,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:17:39,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 16:17:43,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:43,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:43,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:43,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:17:43,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:17:43,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:43,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:43,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:43,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:45,990 WARN L205 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-06-11 16:17:46,444 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-06-11 16:17:47,331 WARN L205 SmtUtils]: Spent 884.00 ms on a formula simplification that was a NOOP. DAG size: 326 [2021-06-11 16:17:48,231 WARN L205 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 326 [2021-06-11 16:17:48,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:48,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:48,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:48,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:49,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:49,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:49,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:49,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:49,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:49,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:49,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:49,946 INFO L147 QuantifierPusher]: treesize reduction 74, result has 28.2 percent of original size 29 [2021-06-11 16:17:50,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:50,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:50,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:50,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:50,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:50,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:17:50,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:17:50,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:50,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:50,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:50,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:51,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:51,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:51,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:51,549 INFO L142 QuantifierPusher]: treesize reduction 12, result has 98.4 percent of original size [2021-06-11 16:17:51,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,569 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 16:17:51,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:17:51,573 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 4, 4, 3, 2, 1] term [2021-06-11 16:17:51,573 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:51,574 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,575 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2021-06-11 16:17:51,575 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:51,577 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,577 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2021-06-11 16:17:51,577 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:17:51,578 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,582 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:51,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:51,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-06-11 16:17:51,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-11 16:17:51,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-11 16:17:51,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 140 [2021-06-11 16:17:51,606 INFO L147 QuantifierPusher]: treesize reduction 201, result has 62.2 percent of original size 331 [2021-06-11 16:17:51,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,807 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:51,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:51,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:51,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:51,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:52,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:52,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:52,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:52,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:17:52,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:17:52,470 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-11 16:17:52,661 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-06-11 16:17:52,880 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-11 16:17:53,057 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-06-11 16:17:53,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:53,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:53,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:53,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:53,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:17:53,760 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 167 [2021-06-11 16:17:54,072 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-06-11 16:17:54,762 WARN L205 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 167 [2021-06-11 16:17:55,079 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-06-11 16:17:55,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,123 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:55,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:55,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:17:55,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:17:55,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:55,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:55,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:17:55,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 16:17:55,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:17:55,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:17:55,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:17:55,143 INFO L163 LiptonReduction]: Checked pairs total: 3586 [2021-06-11 16:17:55,143 INFO L165 LiptonReduction]: Total number of compositions: 91 [2021-06-11 16:17:55,145 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40584 [2021-06-11 16:17:55,153 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-06-11 16:17:55,153 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:55,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:55,154 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:55,154 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:55,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash 949130985, now seen corresponding path program 1 times [2021-06-11 16:17:55,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:55,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991203461] [2021-06-11 16:17:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:55,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:55,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991203461] [2021-06-11 16:17:55,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:55,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:17:55,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818524873] [2021-06-11 16:17:55,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-11 16:17:55,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-11 16:17:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-11 16:17:55,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 220 [2021-06-11 16:17:55,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:55,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 220 [2021-06-11 16:17:55,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:55,305 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:17:55,305 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:55,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-06-11 16:17:55,306 INFO L132 encePairwiseOnDemand]: 219/220 looper letters, 0 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2021-06-11 16:17:55,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 58 flow [2021-06-11 16:17:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-11 16:17:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-06-11 16:17:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 425 transitions. [2021-06-11 16:17:55,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9659090909090909 [2021-06-11 16:17:55,317 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 425 transitions. [2021-06-11 16:17:55,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 425 transitions. [2021-06-11 16:17:55,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:55,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 425 transitions. [2021-06-11 16:17:55,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,329 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,330 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 425 transitions. [2021-06-11 16:17:55,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 58 flow [2021-06-11 16:17:55,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 54 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 16:17:55,333 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2021-06-11 16:17:55,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-06-11 16:17:55,335 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 16:17:55,335 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:55,335 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 54 flow [2021-06-11 16:17:55,335 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 54 flow [2021-06-11 16:17:55,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 54 flow [2021-06-11 16:17:55,340 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:17:55,340 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:55,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-06-11 16:17:55,341 INFO L151 LiptonReduction]: Number of co-enabled transitions 246 [2021-06-11 16:17:55,342 INFO L163 LiptonReduction]: Checked pairs total: 280 [2021-06-11 16:17:55,342 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:55,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 16:17:55,343 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 54 flow [2021-06-11 16:17:55,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 212.5) internal successors, (425), 2 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:55,344 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:55,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 16:17:55,344 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1581843231, now seen corresponding path program 1 times [2021-06-11 16:17:55,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:55,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972955767] [2021-06-11 16:17:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:55,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:55,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972955767] [2021-06-11 16:17:55,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:55,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:17:55,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601033253] [2021-06-11 16:17:55,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:17:55,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:17:55,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:17:55,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 220 [2021-06-11 16:17:55,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:55,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 220 [2021-06-11 16:17:55,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:55,572 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:17:55,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:55,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 16:17:55,573 INFO L132 encePairwiseOnDemand]: 217/220 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-06-11 16:17:55,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 60 flow [2021-06-11 16:17:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:17:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:17:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2021-06-11 16:17:55,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2021-06-11 16:17:55,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2021-06-11 16:17:55,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2021-06-11 16:17:55,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:55,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2021-06-11 16:17:55,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,581 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 54 flow. Second operand 3 states and 595 transitions. [2021-06-11 16:17:55,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 60 flow [2021-06-11 16:17:55,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 16:17:55,582 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 62 flow [2021-06-11 16:17:55,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=62, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-06-11 16:17:55,583 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2021-06-11 16:17:55,583 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:55,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 62 flow [2021-06-11 16:17:55,583 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 62 flow [2021-06-11 16:17:55,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 62 flow [2021-06-11 16:17:55,588 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:17:55,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:17:55,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 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-06-11 16:17:55,588 INFO L151 LiptonReduction]: Number of co-enabled transitions 244 [2021-06-11 16:17:55,598 INFO L163 LiptonReduction]: Checked pairs total: 242 [2021-06-11 16:17:55,598 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:55,598 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 16:17:55,599 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 62 flow [2021-06-11 16:17:55,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:55,600 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:55,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 16:17:55,600 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1520869794, now seen corresponding path program 1 times [2021-06-11 16:17:55,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:55,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757201352] [2021-06-11 16:17:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:55,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:55,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:55,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:55,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757201352] [2021-06-11 16:17:55,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:55,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:17:55,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880551103] [2021-06-11 16:17:55,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:17:55,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:17:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:17:55,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 220 [2021-06-11 16:17:55,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:55,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 220 [2021-06-11 16:17:55,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:55,727 INFO L129 PetriNetUnfolder]: 5/45 cut-off events. [2021-06-11 16:17:55,727 INFO L130 PetriNetUnfolder]: For 10/34 co-relation queries the response was YES. [2021-06-11 16:17:55,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 45 events. 5/45 cut-off events. For 10/34 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 145 event pairs, 1 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 75. Up to 7 conditions per place. [2021-06-11 16:17:55,727 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 4 selfloop transitions, 3 changer transitions 1/26 dead transitions. [2021-06-11 16:17:55,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 87 flow [2021-06-11 16:17:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:17:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:17:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 778 transitions. [2021-06-11 16:17:55,733 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.884090909090909 [2021-06-11 16:17:55,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 778 transitions. [2021-06-11 16:17:55,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 778 transitions. [2021-06-11 16:17:55,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:55,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 778 transitions. [2021-06-11 16:17:55,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:55,740 INFO L185 Difference]: Start difference. First operand has 35 places, 23 transitions, 62 flow. Second operand 4 states and 778 transitions. [2021-06-11 16:17:55,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 87 flow [2021-06-11 16:17:55,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 81 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:17:55,742 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 72 flow [2021-06-11 16:17:55,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2021-06-11 16:17:55,742 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2021-06-11 16:17:55,742 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:55,742 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 72 flow [2021-06-11 16:17:55,743 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 72 flow [2021-06-11 16:17:55,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 72 flow [2021-06-11 16:17:55,749 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:17:55,749 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-06-11 16:17:55,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 23 events. 0/23 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 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-06-11 16:17:55,749 INFO L151 LiptonReduction]: Number of co-enabled transitions 234 [2021-06-11 16:17:56,646 INFO L163 LiptonReduction]: Checked pairs total: 204 [2021-06-11 16:17:56,646 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:56,647 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 905 [2021-06-11 16:17:56,647 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 72 flow [2021-06-11 16:17:56,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:56,648 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:56,648 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:56,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 16:17:56,648 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1818170872, now seen corresponding path program 1 times [2021-06-11 16:17:56,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:56,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125528031] [2021-06-11 16:17:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:56,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:56,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 16:17:56,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:56,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 16:17:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:56,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125528031] [2021-06-11 16:17:56,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:56,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:17:56,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498053960] [2021-06-11 16:17:56,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:17:56,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:17:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:17:56,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 220 [2021-06-11 16:17:56,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:56,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:56,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 220 [2021-06-11 16:17:56,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:56,943 INFO L129 PetriNetUnfolder]: 70/167 cut-off events. [2021-06-11 16:17:56,943 INFO L130 PetriNetUnfolder]: For 101/107 co-relation queries the response was YES. [2021-06-11 16:17:56,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 167 events. 70/167 cut-off events. For 101/107 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 673 event pairs, 48 based on Foata normal form. 9/172 useless extension candidates. Maximal degree in co-relation 338. Up to 85 conditions per place. [2021-06-11 16:17:56,945 INFO L132 encePairwiseOnDemand]: 217/220 looper letters, 17 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-06-11 16:17:56,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 126 flow [2021-06-11 16:17:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:17:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:17:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2021-06-11 16:17:56,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7257575757575757 [2021-06-11 16:17:56,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2021-06-11 16:17:56,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2021-06-11 16:17:56,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:56,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2021-06-11 16:17:56,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:56,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:56,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:56,952 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 72 flow. Second operand 3 states and 479 transitions. [2021-06-11 16:17:56,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 126 flow [2021-06-11 16:17:56,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 114 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 16:17:56,953 INFO L241 Difference]: Finished difference. Result has 37 places, 23 transitions, 68 flow [2021-06-11 16:17:56,953 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=37, PETRI_TRANSITIONS=23} [2021-06-11 16:17:56,954 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-06-11 16:17:56,954 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:56,954 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 68 flow [2021-06-11 16:17:56,954 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 68 flow [2021-06-11 16:17:56,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 68 flow [2021-06-11 16:17:56,959 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:17:56,959 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 16:17:56,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 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-06-11 16:17:56,961 INFO L151 LiptonReduction]: Number of co-enabled transitions 232 [2021-06-11 16:17:57,254 INFO L163 LiptonReduction]: Checked pairs total: 185 [2021-06-11 16:17:57,254 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:57,254 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 300 [2021-06-11 16:17:57,254 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 68 flow [2021-06-11 16:17:57,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:57,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:57,255 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:57,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 16:17:57,255 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -987930285, now seen corresponding path program 1 times [2021-06-11 16:17:57,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:57,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298229336] [2021-06-11 16:17:57,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:57,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:57,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:17:57,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:57,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 16:17:57,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:57,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:17:57,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:57,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 16:17:57,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:57,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:17:57,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:57,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 16:17:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:57,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298229336] [2021-06-11 16:17:57,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:57,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:17:57,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750884530] [2021-06-11 16:17:57,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:17:57,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:17:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:17:57,518 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 220 [2021-06-11 16:17:57,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 68 flow. Second operand has 8 states, 8 states have (on average 141.875) internal successors, (1135), 8 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:57,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:57,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 220 [2021-06-11 16:17:57,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:57,719 INFO L129 PetriNetUnfolder]: 68/157 cut-off events. [2021-06-11 16:17:57,719 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-06-11 16:17:57,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 157 events. 68/157 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 591 event pairs, 20 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 354. Up to 109 conditions per place. [2021-06-11 16:17:57,722 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 13 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-06-11 16:17:57,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 113 flow [2021-06-11 16:17:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:17:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:17:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2021-06-11 16:17:57,725 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2021-06-11 16:17:57,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2021-06-11 16:17:57,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2021-06-11 16:17:57,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:57,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2021-06-11 16:17:57,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:57,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:57,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:57,728 INFO L185 Difference]: Start difference. First operand has 37 places, 23 transitions, 68 flow. Second operand 3 states and 440 transitions. [2021-06-11 16:17:57,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 113 flow [2021-06-11 16:17:57,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:17:57,730 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 83 flow [2021-06-11 16:17:57,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-06-11 16:17:57,730 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2021-06-11 16:17:57,730 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:57,730 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 83 flow [2021-06-11 16:17:57,731 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 83 flow [2021-06-11 16:17:57,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 83 flow [2021-06-11 16:17:57,740 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-06-11 16:17:57,740 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-06-11 16:17:57,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 33 events. 3/33 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2021-06-11 16:17:57,741 INFO L151 LiptonReduction]: Number of co-enabled transitions 250 [2021-06-11 16:17:58,009 INFO L163 LiptonReduction]: Checked pairs total: 149 [2021-06-11 16:17:58,009 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:58,009 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 279 [2021-06-11 16:17:58,010 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 83 flow [2021-06-11 16:17:58,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 141.875) internal successors, (1135), 8 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:58,011 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:58,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 16:17:58,011 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:58,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:58,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1334265720, now seen corresponding path program 1 times [2021-06-11 16:17:58,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:58,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027994803] [2021-06-11 16:17:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:58,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 16:17:58,093 INFO L142 QuantifierPusher]: treesize reduction 2, result has 86.7 percent of original size [2021-06-11 16:17:58,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:17:58,104 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size [2021-06-11 16:17:58,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:17:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:58,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027994803] [2021-06-11 16:17:58,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:58,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:17:58,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752277926] [2021-06-11 16:17:58,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:17:58,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:58,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:17:58,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:17:58,121 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 220 [2021-06-11 16:17:58,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 159.6) internal successors, (798), 5 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:58,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 220 [2021-06-11 16:17:58,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:58,305 INFO L129 PetriNetUnfolder]: 100/251 cut-off events. [2021-06-11 16:17:58,305 INFO L130 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2021-06-11 16:17:58,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 251 events. 100/251 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1233 event pairs, 58 based on Foata normal form. 3/245 useless extension candidates. Maximal degree in co-relation 585. Up to 128 conditions per place. [2021-06-11 16:17:58,307 INFO L132 encePairwiseOnDemand]: 210/220 looper letters, 18 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2021-06-11 16:17:58,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 196 flow [2021-06-11 16:17:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:17:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:17:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 975 transitions. [2021-06-11 16:17:58,312 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7386363636363636 [2021-06-11 16:17:58,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 975 transitions. [2021-06-11 16:17:58,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 975 transitions. [2021-06-11 16:17:58,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:58,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 975 transitions. [2021-06-11 16:17:58,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.5) internal successors, (975), 6 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,324 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 83 flow. Second operand 6 states and 975 transitions. [2021-06-11 16:17:58,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 196 flow [2021-06-11 16:17:58,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:17:58,327 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 176 flow [2021-06-11 16:17:58,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-06-11 16:17:58,328 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2021-06-11 16:17:58,328 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:58,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 176 flow [2021-06-11 16:17:58,328 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 176 flow [2021-06-11 16:17:58,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 176 flow [2021-06-11 16:17:58,352 INFO L129 PetriNetUnfolder]: 52/148 cut-off events. [2021-06-11 16:17:58,352 INFO L130 PetriNetUnfolder]: For 125/135 co-relation queries the response was YES. [2021-06-11 16:17:58,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 148 events. 52/148 cut-off events. For 125/135 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 649 event pairs, 16 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 381. Up to 84 conditions per place. [2021-06-11 16:17:58,355 INFO L151 LiptonReduction]: Number of co-enabled transitions 308 [2021-06-11 16:17:58,416 INFO L163 LiptonReduction]: Checked pairs total: 121 [2021-06-11 16:17:58,416 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:58,417 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-06-11 16:17:58,417 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 176 flow [2021-06-11 16:17:58,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.6) internal successors, (798), 5 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:58,418 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:58,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 16:17:58,418 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1035140812, now seen corresponding path program 1 times [2021-06-11 16:17:58,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:58,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574303678] [2021-06-11 16:17:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:58,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:58,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:17:58,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:58,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574303678] [2021-06-11 16:17:58,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:58,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:17:58,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572915450] [2021-06-11 16:17:58,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:17:58,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:17:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:17:58,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 220 [2021-06-11 16:17:58,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:58,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 220 [2021-06-11 16:17:58,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:58,663 INFO L129 PetriNetUnfolder]: 485/870 cut-off events. [2021-06-11 16:17:58,664 INFO L130 PetriNetUnfolder]: For 694/981 co-relation queries the response was YES. [2021-06-11 16:17:58,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 870 events. 485/870 cut-off events. For 694/981 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 5157 event pairs, 224 based on Foata normal form. 112/878 useless extension candidates. Maximal degree in co-relation 2247. Up to 486 conditions per place. [2021-06-11 16:17:58,671 INFO L132 encePairwiseOnDemand]: 213/220 looper letters, 11 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2021-06-11 16:17:58,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 244 flow [2021-06-11 16:17:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:17:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:17:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 967 transitions. [2021-06-11 16:17:58,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8790909090909091 [2021-06-11 16:17:58,675 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 967 transitions. [2021-06-11 16:17:58,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 967 transitions. [2021-06-11 16:17:58,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:58,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 967 transitions. [2021-06-11 16:17:58,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,679 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,679 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 176 flow. Second operand 5 states and 967 transitions. [2021-06-11 16:17:58,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 244 flow [2021-06-11 16:17:58,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 237 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 16:17:58,685 INFO L241 Difference]: Finished difference. Result has 51 places, 44 transitions, 248 flow [2021-06-11 16:17:58,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2021-06-11 16:17:58,686 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2021-06-11 16:17:58,686 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:58,686 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 248 flow [2021-06-11 16:17:58,686 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 248 flow [2021-06-11 16:17:58,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 248 flow [2021-06-11 16:17:58,784 INFO L129 PetriNetUnfolder]: 494/873 cut-off events. [2021-06-11 16:17:58,784 INFO L130 PetriNetUnfolder]: For 1135/1448 co-relation queries the response was YES. [2021-06-11 16:17:58,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 873 events. 494/873 cut-off events. For 1135/1448 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 5216 event pairs, 212 based on Foata normal form. 17/774 useless extension candidates. Maximal degree in co-relation 2772. Up to 535 conditions per place. [2021-06-11 16:17:58,795 INFO L151 LiptonReduction]: Number of co-enabled transitions 484 [2021-06-11 16:17:58,799 INFO L163 LiptonReduction]: Checked pairs total: 105 [2021-06-11 16:17:58,799 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:58,799 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-06-11 16:17:58,800 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 248 flow [2021-06-11 16:17:58,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:58,801 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:58,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 16:17:58,801 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1272849116, now seen corresponding path program 1 times [2021-06-11 16:17:58,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:58,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638772219] [2021-06-11 16:17:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:58,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:58,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:58,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:58,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:58,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638772219] [2021-06-11 16:17:58,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:58,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:17:58,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327559662] [2021-06-11 16:17:58,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:17:58,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:17:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:17:58,879 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2021-06-11 16:17:58,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:58,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:58,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2021-06-11 16:17:58,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:59,166 INFO L129 PetriNetUnfolder]: 1000/1789 cut-off events. [2021-06-11 16:17:59,167 INFO L130 PetriNetUnfolder]: For 3052/3758 co-relation queries the response was YES. [2021-06-11 16:17:59,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1789 events. 1000/1789 cut-off events. For 3052/3758 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 12448 event pairs, 461 based on Foata normal form. 86/1597 useless extension candidates. Maximal degree in co-relation 5664. Up to 1161 conditions per place. [2021-06-11 16:17:59,184 INFO L132 encePairwiseOnDemand]: 217/220 looper letters, 6 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2021-06-11 16:17:59,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 270 flow [2021-06-11 16:17:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:17:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:17:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2021-06-11 16:17:59,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8772727272727273 [2021-06-11 16:17:59,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2021-06-11 16:17:59,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2021-06-11 16:17:59,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:59,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2021-06-11 16:17:59,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,192 INFO L185 Difference]: Start difference. First operand has 51 places, 44 transitions, 248 flow. Second operand 4 states and 772 transitions. [2021-06-11 16:17:59,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 270 flow [2021-06-11 16:17:59,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:17:59,201 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 258 flow [2021-06-11 16:17:59,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2021-06-11 16:17:59,201 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2021-06-11 16:17:59,201 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:59,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 258 flow [2021-06-11 16:17:59,202 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 258 flow [2021-06-11 16:17:59,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 258 flow [2021-06-11 16:17:59,410 INFO L129 PetriNetUnfolder]: 974/1708 cut-off events. [2021-06-11 16:17:59,411 INFO L130 PetriNetUnfolder]: For 2463/3142 co-relation queries the response was YES. [2021-06-11 16:17:59,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5470 conditions, 1708 events. 974/1708 cut-off events. For 2463/3142 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 11601 event pairs, 437 based on Foata normal form. 25/1468 useless extension candidates. Maximal degree in co-relation 5450. Up to 1102 conditions per place. [2021-06-11 16:17:59,432 INFO L151 LiptonReduction]: Number of co-enabled transitions 500 [2021-06-11 16:17:59,440 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:17:59,440 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:59,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 239 [2021-06-11 16:17:59,441 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 258 flow [2021-06-11 16:17:59,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:59,441 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:59,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 16:17:59,441 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:59,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1719644340, now seen corresponding path program 2 times [2021-06-11 16:17:59,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:59,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443041104] [2021-06-11 16:17:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:17:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:17:59,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:59,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:59,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:59,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:17:59,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:59,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:17:59,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:17:59,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:17:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:17:59,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443041104] [2021-06-11 16:17:59,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:17:59,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:17:59,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489813910] [2021-06-11 16:17:59,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:17:59,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:17:59,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:17:59,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:17:59,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 220 [2021-06-11 16:17:59,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:17:59,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 220 [2021-06-11 16:17:59,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:17:59,774 INFO L129 PetriNetUnfolder]: 689/1365 cut-off events. [2021-06-11 16:17:59,774 INFO L130 PetriNetUnfolder]: For 3455/7488 co-relation queries the response was YES. [2021-06-11 16:17:59,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5304 conditions, 1365 events. 689/1365 cut-off events. For 3455/7488 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 9565 event pairs, 140 based on Foata normal form. 417/1627 useless extension candidates. Maximal degree in co-relation 5282. Up to 937 conditions per place. [2021-06-11 16:17:59,788 INFO L132 encePairwiseOnDemand]: 213/220 looper letters, 11 selfloop transitions, 19 changer transitions 0/58 dead transitions. [2021-06-11 16:17:59,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 394 flow [2021-06-11 16:17:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:17:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:17:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1354 transitions. [2021-06-11 16:17:59,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8792207792207792 [2021-06-11 16:17:59,792 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1354 transitions. [2021-06-11 16:17:59,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1354 transitions. [2021-06-11 16:17:59,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:17:59,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1354 transitions. [2021-06-11 16:17:59,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.42857142857142) internal successors, (1354), 7 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,799 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 258 flow. Second operand 7 states and 1354 transitions. [2021-06-11 16:17:59,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 394 flow [2021-06-11 16:17:59,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:17:59,807 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 395 flow [2021-06-11 16:17:59,807 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2021-06-11 16:17:59,807 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2021-06-11 16:17:59,807 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:17:59,807 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 54 transitions, 395 flow [2021-06-11 16:17:59,808 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 54 transitions, 395 flow [2021-06-11 16:17:59,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions, 395 flow [2021-06-11 16:17:59,942 INFO L129 PetriNetUnfolder]: 706/1368 cut-off events. [2021-06-11 16:17:59,943 INFO L130 PetriNetUnfolder]: For 5887/9666 co-relation queries the response was YES. [2021-06-11 16:17:59,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6255 conditions, 1368 events. 706/1368 cut-off events. For 5887/9666 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 9931 event pairs, 150 based on Foata normal form. 15/1206 useless extension candidates. Maximal degree in co-relation 6231. Up to 936 conditions per place. [2021-06-11 16:17:59,963 INFO L151 LiptonReduction]: Number of co-enabled transitions 672 [2021-06-11 16:17:59,969 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:17:59,970 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:17:59,970 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 163 [2021-06-11 16:17:59,970 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 395 flow [2021-06-11 16:17:59,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:17:59,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:17:59,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:17:59,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 16:17:59,972 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:17:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:17:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash 492432949, now seen corresponding path program 1 times [2021-06-11 16:17:59,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:17:59,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732629121] [2021-06-11 16:17:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:18:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:18:00,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:18:00,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:18:00,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732629121] [2021-06-11 16:18:00,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:18:00,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:18:00,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076505729] [2021-06-11 16:18:00,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:18:00,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:18:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:18:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:18:00,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 220 [2021-06-11 16:18:00,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:18:00,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 220 [2021-06-11 16:18:00,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:18:00,328 INFO L129 PetriNetUnfolder]: 484/1056 cut-off events. [2021-06-11 16:18:00,329 INFO L130 PetriNetUnfolder]: For 6803/14564 co-relation queries the response was YES. [2021-06-11 16:18:00,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5710 conditions, 1056 events. 484/1056 cut-off events. For 6803/14564 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 7563 event pairs, 25 based on Foata normal form. 558/1484 useless extension candidates. Maximal degree in co-relation 5684. Up to 846 conditions per place. [2021-06-11 16:18:00,339 INFO L132 encePairwiseOnDemand]: 213/220 looper letters, 7 selfloop transitions, 28 changer transitions 4/67 dead transitions. [2021-06-11 16:18:00,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 599 flow [2021-06-11 16:18:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:18:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:18:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1741 transitions. [2021-06-11 16:18:00,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8792929292929293 [2021-06-11 16:18:00,349 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1741 transitions. [2021-06-11 16:18:00,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1741 transitions. [2021-06-11 16:18:00,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:18:00,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1741 transitions. [2021-06-11 16:18:00,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.44444444444446) internal successors, (1741), 9 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,358 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,358 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 395 flow. Second operand 9 states and 1741 transitions. [2021-06-11 16:18:00,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 599 flow [2021-06-11 16:18:00,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 549 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-06-11 16:18:00,369 INFO L241 Difference]: Finished difference. Result has 71 places, 63 transitions, 527 flow [2021-06-11 16:18:00,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=527, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2021-06-11 16:18:00,370 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 35 predicate places. [2021-06-11 16:18:00,370 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:18:00,370 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 63 transitions, 527 flow [2021-06-11 16:18:00,370 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 63 transitions, 527 flow [2021-06-11 16:18:00,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 63 transitions, 527 flow [2021-06-11 16:18:00,457 INFO L129 PetriNetUnfolder]: 450/1006 cut-off events. [2021-06-11 16:18:00,458 INFO L130 PetriNetUnfolder]: For 7108/9173 co-relation queries the response was YES. [2021-06-11 16:18:00,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5106 conditions, 1006 events. 450/1006 cut-off events. For 7108/9173 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 7662 event pairs, 28 based on Foata normal form. 28/895 useless extension candidates. Maximal degree in co-relation 5079. Up to 599 conditions per place. [2021-06-11 16:18:00,473 INFO L151 LiptonReduction]: Number of co-enabled transitions 736 [2021-06-11 16:18:00,482 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:18:00,482 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:18:00,482 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 112 [2021-06-11 16:18:00,483 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 527 flow [2021-06-11 16:18:00,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:18:00,484 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:18:00,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 16:18:00,484 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:18:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:18:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash -964366527, now seen corresponding path program 1 times [2021-06-11 16:18:00,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:18:00,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679218335] [2021-06-11 16:18:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:18:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:18:00,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:18:00,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:18:00,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:18:00,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679218335] [2021-06-11 16:18:00,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:18:00,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:18:00,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184696783] [2021-06-11 16:18:00,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 16:18:00,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:18:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 16:18:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 16:18:00,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 220 [2021-06-11 16:18:00,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 527 flow. Second operand has 7 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:18:00,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 220 [2021-06-11 16:18:00,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:18:00,825 INFO L129 PetriNetUnfolder]: 401/920 cut-off events. [2021-06-11 16:18:00,825 INFO L130 PetriNetUnfolder]: For 9934/15109 co-relation queries the response was YES. [2021-06-11 16:18:00,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 920 events. 401/920 cut-off events. For 9934/15109 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 6719 event pairs, 10 based on Foata normal form. 563/1359 useless extension candidates. Maximal degree in co-relation 5379. Up to 549 conditions per place. [2021-06-11 16:18:00,834 INFO L132 encePairwiseOnDemand]: 213/220 looper letters, 2 selfloop transitions, 33 changer transitions 5/67 dead transitions. [2021-06-11 16:18:00,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 67 transitions, 643 flow [2021-06-11 16:18:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 16:18:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 16:18:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2120 transitions. [2021-06-11 16:18:00,840 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2021-06-11 16:18:00,840 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2120 transitions. [2021-06-11 16:18:00,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2120 transitions. [2021-06-11 16:18:00,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:18:00,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2120 transitions. [2021-06-11 16:18:00,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 192.72727272727272) internal successors, (2120), 11 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,850 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:00,850 INFO L185 Difference]: Start difference. First operand has 71 places, 63 transitions, 527 flow. Second operand 11 states and 2120 transitions. [2021-06-11 16:18:00,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 67 transitions, 643 flow [2021-06-11 16:18:00,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 67 transitions, 529 flow, removed 40 selfloop flow, removed 6 redundant places. [2021-06-11 16:18:00,888 INFO L241 Difference]: Finished difference. Result has 78 places, 62 transitions, 483 flow [2021-06-11 16:18:00,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=483, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2021-06-11 16:18:00,888 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2021-06-11 16:18:00,888 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:18:00,888 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 62 transitions, 483 flow [2021-06-11 16:18:00,888 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 62 transitions, 483 flow [2021-06-11 16:18:00,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 62 transitions, 483 flow [2021-06-11 16:18:00,937 INFO L129 PetriNetUnfolder]: 256/641 cut-off events. [2021-06-11 16:18:00,937 INFO L130 PetriNetUnfolder]: For 2720/3191 co-relation queries the response was YES. [2021-06-11 16:18:00,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 641 events. 256/641 cut-off events. For 2720/3191 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 4643 event pairs, 8 based on Foata normal form. 22/575 useless extension candidates. Maximal degree in co-relation 2676. Up to 180 conditions per place. [2021-06-11 16:18:00,946 INFO L151 LiptonReduction]: Number of co-enabled transitions 630 [2021-06-11 16:18:00,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:00,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:01,108 INFO L163 LiptonReduction]: Checked pairs total: 108 [2021-06-11 16:18:01,108 INFO L165 LiptonReduction]: Total number of compositions: 4 [2021-06-11 16:18:01,108 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 220 [2021-06-11 16:18:01,111 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 484 flow [2021-06-11 16:18:01,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:01,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:18:01,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:18:01,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-11 16:18:01,111 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:18:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:18:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1419776843, now seen corresponding path program 1 times [2021-06-11 16:18:01,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:18:01,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225991836] [2021-06-11 16:18:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:18:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:18:01,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:01,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 16:18:01,250 INFO L142 QuantifierPusher]: treesize reduction 26, result has 42.2 percent of original size [2021-06-11 16:18:01,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:18:01,266 INFO L142 QuantifierPusher]: treesize reduction 40, result has 39.4 percent of original size [2021-06-11 16:18:01,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-11 16:18:01,288 INFO L142 QuantifierPusher]: treesize reduction 60, result has 53.1 percent of original size [2021-06-11 16:18:01,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-06-11 16:18:01,337 INFO L142 QuantifierPusher]: treesize reduction 47, result has 39.7 percent of original size [2021-06-11 16:18:01,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 16:18:01,361 INFO L142 QuantifierPusher]: treesize reduction 47, result has 34.7 percent of original size [2021-06-11 16:18:01,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 16:18:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:18:01,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225991836] [2021-06-11 16:18:01,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:18:01,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:18:01,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903641516] [2021-06-11 16:18:01,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:18:01,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:18:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:18:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:18:01,384 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 224 [2021-06-11 16:18:01,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 151.375) internal successors, (1211), 8 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:01,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:18:01,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 224 [2021-06-11 16:18:01,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:18:01,709 INFO L129 PetriNetUnfolder]: 438/1039 cut-off events. [2021-06-11 16:18:01,709 INFO L130 PetriNetUnfolder]: For 4859/5442 co-relation queries the response was YES. [2021-06-11 16:18:01,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 1039 events. 438/1039 cut-off events. For 4859/5442 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 8009 event pairs, 10 based on Foata normal form. 48/971 useless extension candidates. Maximal degree in co-relation 4450. Up to 290 conditions per place. [2021-06-11 16:18:01,720 INFO L132 encePairwiseOnDemand]: 211/224 looper letters, 19 selfloop transitions, 19 changer transitions 4/81 dead transitions. [2021-06-11 16:18:01,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 690 flow [2021-06-11 16:18:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:18:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:18:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 936 transitions. [2021-06-11 16:18:01,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2021-06-11 16:18:01,724 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 936 transitions. [2021-06-11 16:18:01,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 936 transitions. [2021-06-11 16:18:01,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:18:01,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 936 transitions. [2021-06-11 16:18:01,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 156.0) internal successors, (936), 6 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:01,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:01,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:01,729 INFO L185 Difference]: Start difference. First operand has 75 places, 61 transitions, 484 flow. Second operand 6 states and 936 transitions. [2021-06-11 16:18:01,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 690 flow [2021-06-11 16:18:01,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 567 flow, removed 31 selfloop flow, removed 11 redundant places. [2021-06-11 16:18:01,763 INFO L241 Difference]: Finished difference. Result has 72 places, 69 transitions, 490 flow [2021-06-11 16:18:01,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2021-06-11 16:18:01,764 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2021-06-11 16:18:01,764 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:18:01,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 69 transitions, 490 flow [2021-06-11 16:18:01,764 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 69 transitions, 490 flow [2021-06-11 16:18:01,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 69 transitions, 490 flow [2021-06-11 16:18:01,828 INFO L129 PetriNetUnfolder]: 362/882 cut-off events. [2021-06-11 16:18:01,828 INFO L130 PetriNetUnfolder]: For 1925/2113 co-relation queries the response was YES. [2021-06-11 16:18:01,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 882 events. 362/882 cut-off events. For 1925/2113 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 7103 event pairs, 7 based on Foata normal form. 30/820 useless extension candidates. Maximal degree in co-relation 3175. Up to 250 conditions per place. [2021-06-11 16:18:01,839 INFO L151 LiptonReduction]: Number of co-enabled transitions 742 [2021-06-11 16:18:01,850 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:18:01,850 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:18:01,850 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-06-11 16:18:01,850 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 490 flow [2021-06-11 16:18:01,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 151.375) internal successors, (1211), 8 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:18:01,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:18:01,863 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-06-11 16:18:01,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-11 16:18:01,863 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:18:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:18:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash 287021581, now seen corresponding path program 1 times [2021-06-11 16:18:01,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:18:01,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334347826] [2021-06-11 16:18:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:18:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:18:01,980 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:18:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:18:02,090 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:18:02,136 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:18:02,136 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:18:02,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-11 16:18:02,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:18:02 BasicIcfg [2021-06-11 16:18:02,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:18:02,246 INFO L168 Benchmark]: Toolchain (without parser) took 51402.14 ms. Allocated memory was 352.3 MB in the beginning and 901.8 MB in the end (delta: 549.5 MB). Free memory was 315.2 MB in the beginning and 757.6 MB in the end (delta: -442.4 MB). Peak memory consumption was 109.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:18:02,246 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 352.3 MB. Free memory was 333.4 MB in the beginning and 333.4 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:18:02,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.63 ms. Allocated memory is still 352.3 MB. Free memory was 315.0 MB in the beginning and 309.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-11 16:18:02,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.73 ms. Allocated memory is still 352.3 MB. Free memory was 309.0 MB in the beginning and 306.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:18:02,246 INFO L168 Benchmark]: Boogie Preprocessor took 58.00 ms. Allocated memory is still 352.3 MB. Free memory was 306.9 MB in the beginning and 302.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:18:02,246 INFO L168 Benchmark]: RCFGBuilder took 2764.69 ms. Allocated memory was 352.3 MB in the beginning and 434.1 MB in the end (delta: 81.8 MB). Free memory was 302.7 MB in the beginning and 250.6 MB in the end (delta: 52.0 MB). Peak memory consumption was 161.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:18:02,246 INFO L168 Benchmark]: TraceAbstraction took 47949.09 ms. Allocated memory was 434.1 MB in the beginning and 901.8 MB in the end (delta: 467.7 MB). Free memory was 249.6 MB in the beginning and 757.6 MB in the end (delta: -508.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:18:02,247 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.16 ms. Allocated memory is still 352.3 MB. Free memory was 333.4 MB in the beginning and 333.4 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 537.63 ms. Allocated memory is still 352.3 MB. Free memory was 315.0 MB in the beginning and 309.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.73 ms. Allocated memory is still 352.3 MB. Free memory was 309.0 MB in the beginning and 306.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 58.00 ms. Allocated memory is still 352.3 MB. Free memory was 306.9 MB in the beginning and 302.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2764.69 ms. Allocated memory was 352.3 MB in the beginning and 434.1 MB in the end (delta: 81.8 MB). Free memory was 302.7 MB in the beginning and 250.6 MB in the end (delta: 52.0 MB). Peak memory consumption was 161.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 47949.09 ms. Allocated memory was 434.1 MB in the beginning and 901.8 MB in the end (delta: 467.7 MB). Free memory was 249.6 MB in the beginning and 757.6 MB in the end (delta: -508.0 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: 40562.9ms, 123 PlacesBefore, 36 PlacesAfterwards, 111 TransitionsBefore, 24 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 9 FixpointIterations, 58 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, 3586 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1697, positive: 1531, positive conditional: 1531, positive unconditional: 0, negative: 166, negative conditional: 166, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1697, positive: 1531, positive conditional: 0, positive unconditional: 1531, negative: 166, negative conditional: 0, negative unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1697, positive: 1531, positive conditional: 0, positive unconditional: 1531, negative: 166, negative conditional: 0, negative unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 923, positive: 886, positive conditional: 0, positive unconditional: 886, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 923, positive: 864, positive conditional: 0, positive unconditional: 864, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13918, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 404, negative conditional: 0, negative unconditional: 404, unknown: 13462, unknown conditional: 0, unknown unconditional: 13462] ], Cache Queries: [ total: 1697, positive: 645, positive conditional: 0, positive unconditional: 645, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 923, unknown conditional: 0, unknown unconditional: 923] , Statistics on independence cache: Total cache size (in pairs): 923, Positive cache size: 886, Positive conditional cache size: 0, Positive unconditional cache size: 886, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8ms, 33 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 926, Positive cache size: 889, Positive conditional cache size: 0, Positive unconditional cache size: 889, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.9ms, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 242 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 90, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 890, Positive conditional cache size: 0, Positive unconditional cache size: 890, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 903.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 204 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 895, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 818, unknown conditional: 0, unknown unconditional: 818] ], Cache Queries: [ total: 64, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 933, Positive cache size: 891, Positive conditional cache size: 0, Positive unconditional cache size: 891, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 299.4ms, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, positive: 50, positive conditional: 1, positive unconditional: 49, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 50, positive conditional: 1, positive unconditional: 49, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 290, negative conditional: 0, negative unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 50, positive conditional: 1, positive unconditional: 49, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 891, Positive conditional cache size: 0, Positive unconditional cache size: 891, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 278.6ms, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 149 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, positive: 44, positive conditional: 2, positive unconditional: 42, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 44, positive conditional: 2, positive unconditional: 42, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 266, negative conditional: 0, negative unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 38, positive conditional: 2, positive unconditional: 36, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 947, Positive cache size: 897, Positive conditional cache size: 0, Positive unconditional cache size: 897, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.1ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 121 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, positive: 45, positive conditional: 15, positive unconditional: 30, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 45, positive conditional: 15, positive unconditional: 30, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 43, positive conditional: 15, positive unconditional: 28, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 899, Positive conditional cache size: 0, Positive unconditional cache size: 899, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 112.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 9, positive conditional: 6, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 899, Positive conditional cache size: 0, Positive unconditional cache size: 899, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 238.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 899, Positive conditional cache size: 0, Positive unconditional cache size: 899, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 162.0ms, 63 PlacesBefore, 63 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 899, Positive conditional cache size: 0, Positive unconditional cache size: 899, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.4ms, 71 PlacesBefore, 71 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 899, Positive conditional cache size: 0, Positive unconditional cache size: 899, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.5ms, 78 PlacesBefore, 75 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 108 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 108, positive conditional: 92, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 108, positive conditional: 92, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 108, positive: 101, positive conditional: 87, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 906, Positive conditional cache size: 5, Positive unconditional cache size: 901, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.8ms, 72 PlacesBefore, 72 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 906, Positive conditional cache size: 5, Positive unconditional cache size: 901, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L772] EXPR 1 !y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L773] EXPR 1 !y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L774] EXPR 1 !y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))) [L774] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] EXPR 1 !y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L775] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] EXPR 1 !y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L776] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] EXPR 1 !y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L777] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 pthread_t t2228; [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = x [L812] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=13, weak$$choice1=1, weak$$choice2=255, x=1, y={9:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 47665.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2361.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40672.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 44 SDslu, 32 SDs, 0 SdLazy, 406 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 526.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 625.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=527occurred in iteration=10, InterpolantAutomatonStates: 63, 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: 50.3ms SsaConstructionTime, 671.0ms SatisfiabilityAnalysisTime, 1023.6ms InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...