/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/safe000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:25:57,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:25:57,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:25:57,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:25:57,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:25:57,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:25:57,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:25:57,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:25:57,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:25:57,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:25:57,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:25:57,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:25:57,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:25:57,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:25:57,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:25:57,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:25:57,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:25:57,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:25:57,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:25:57,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:25:57,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:25:57,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:25:57,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:25:57,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:25:57,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:25:57,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:25:57,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:25:57,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:25:57,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:25:57,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:25:57,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:25:57,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:25:57,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:25:57,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:25:57,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:25:57,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:25:57,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:25:57,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:25:57,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:25:57,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:25:57,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:25:57,492 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-03-26 10:25:57,505 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:25:57,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:25:57,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:25:57,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:25:57,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:25:57,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:25:57,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:25:57,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:25:57,509 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:25:57,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:25:57,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:25:57,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:25:57,805 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:25:57,806 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:25:57,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.opt.i [2021-03-26 10:25:57,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec265e581/79d5bb69889d4f4fba6f9a192633acd6/FLAGa3f7630e6 [2021-03-26 10:25:58,297 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:25:58,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.opt.i [2021-03-26 10:25:58,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec265e581/79d5bb69889d4f4fba6f9a192633acd6/FLAGa3f7630e6 [2021-03-26 10:25:58,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec265e581/79d5bb69889d4f4fba6f9a192633acd6 [2021-03-26 10:25:58,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:25:58,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:25:58,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:25:58,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:25:58,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:25:58,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:25:58" (1/1) ... [2021-03-26 10:25:58,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e37c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:58, skipping insertion in model container [2021-03-26 10:25:58,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:25:58" (1/1) ... [2021-03-26 10:25:58,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:25:58,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:25:59,010 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.opt.i[992,1005] [2021-03-26 10:25:59,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:25:59,210 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:25:59,217 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.opt.i[992,1005] [2021-03-26 10:25:59,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:25:59,310 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:25:59,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59 WrapperNode [2021-03-26 10:25:59,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:25:59,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:25:59,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:25:59,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:25:59,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:25:59,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:25:59,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:25:59,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:25:59,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... [2021-03-26 10:25:59,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:25:59,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:25:59,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:25:59,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:25:59,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:25:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:25:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:25:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:25:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:25:59,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:25:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:25:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:25:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:25:59,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:25:59,441 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:26:01,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:26:01,697 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 10:26:01,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:26:01 BoogieIcfgContainer [2021-03-26 10:26:01,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:26:01,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:26:01,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:26:01,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:26:01,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:25:58" (1/3) ... [2021-03-26 10:26:01,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46676020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:26:01, skipping insertion in model container [2021-03-26 10:26:01,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:25:59" (2/3) ... [2021-03-26 10:26:01,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46676020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:26:01, skipping insertion in model container [2021-03-26 10:26:01,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:26:01" (3/3) ... [2021-03-26 10:26:01,703 INFO L111 eAbstractionObserver]: Analyzing ICFG safe000_rmo.opt.i [2021-03-26 10:26:01,707 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:26:01,710 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 10:26:01,711 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:26:01,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,798 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:01,800 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:26:01,811 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-26 10:26:01,832 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:26:01,832 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:26:01,832 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:26:01,835 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:26:01,835 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:26:01,835 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:26:01,835 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:26:01,835 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:26:01,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-03-26 10:26:01,885 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 10:26:01,885 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:01,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2021-03-26 10:26:01,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-03-26 10:26:01,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 99 transitions, 207 flow [2021-03-26 10:26:01,901 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:01,911 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-26 10:26:01,913 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-26 10:26:01,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 99 transitions, 207 flow [2021-03-26 10:26:01,942 INFO L129 PetriNetUnfolder]: 1/99 cut-off events. [2021-03-26 10:26:01,942 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:01,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 1/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 10:26:01,945 INFO L142 LiptonReduction]: Number of co-enabled transitions 1018 [2021-03-26 10:26:02,672 WARN L205 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2021-03-26 10:26:03,189 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-03-26 10:26:04,430 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-03-26 10:26:04,983 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:26:07,421 WARN L205 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-26 10:26:07,733 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-26 10:26:09,061 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-26 10:26:09,730 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-26 10:26:09,967 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 10:26:10,340 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 10:26:10,462 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:26:18,450 WARN L205 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2021-03-26 10:26:18,840 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:26:20,587 WARN L205 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 370 DAG size of output: 326 [2021-03-26 10:26:21,441 WARN L205 SmtUtils]: Spent 852.00 ms on a formula simplification that was a NOOP. DAG size: 323 [2021-03-26 10:26:25,911 INFO L154 LiptonReduction]: Checked pairs total: 1971 [2021-03-26 10:26:25,911 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-26 10:26:25,913 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24013 [2021-03-26 10:26:25,921 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2021-03-26 10:26:25,921 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:25,921 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:25,922 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:25,922 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:25,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash -231262278, now seen corresponding path program 1 times [2021-03-26 10:26:25,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:25,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708789098] [2021-03-26 10:26:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:26,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:26,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:26,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:26,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:26,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708789098] [2021-03-26 10:26:26,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:26,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:26:26,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015104819] [2021-03-26 10:26:26,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-03-26 10:26:26,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-03-26 10:26:26,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-03-26 10:26:26,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 177 [2021-03-26 10:26:26,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 2 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:26,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:26,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 177 [2021-03-26 10:26:26,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:26,109 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 10:26:26,109 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:26,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-26 10:26:26,110 INFO L132 encePairwiseOnDemand]: 176/177 looper letters, 0 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2021-03-26 10:26:26,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 81 flow [2021-03-26 10:26:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-26 10:26:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-03-26 10:26:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2021-03-26 10:26:26,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9745762711864406 [2021-03-26 10:26:26,122 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 345 transitions. [2021-03-26 10:26:26,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 345 transitions. [2021-03-26 10:26:26,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:26,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 345 transitions. [2021-03-26 10:26:26,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:26,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:26,142 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:26,144 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 2 states and 345 transitions. [2021-03-26 10:26:26,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 81 flow [2021-03-26 10:26:26,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:26:26,148 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 78 flow [2021-03-26 10:26:26,149 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2021-03-26 10:26:26,150 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:26:26,150 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:26,150 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 78 flow [2021-03-26 10:26:26,152 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 78 flow [2021-03-26 10:26:26,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 78 flow [2021-03-26 10:26:26,158 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 10:26:26,159 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:26,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-26 10:26:26,159 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-26 10:26:26,298 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-03-26 10:26:26,457 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-03-26 10:26:26,952 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-03-26 10:26:27,379 WARN L205 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-03-26 10:26:29,145 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 326 DAG size of output: 325 [2021-03-26 10:26:29,967 WARN L205 SmtUtils]: Spent 820.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2021-03-26 10:26:31,827 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-03-26 10:26:32,057 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 10:26:32,193 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 10:26:39,438 INFO L154 LiptonReduction]: Checked pairs total: 965 [2021-03-26 10:26:39,438 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:26:39,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13288 [2021-03-26 10:26:39,439 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 54 flow [2021-03-26 10:26:39,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 172.5) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:39,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:39,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:39,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:26:39,440 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -231401623, now seen corresponding path program 1 times [2021-03-26 10:26:39,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:39,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718166064] [2021-03-26 10:26:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:39,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:39,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:39,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:39,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:39,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:39,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:39,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:39,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:26:39,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:39,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:26:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:39,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718166064] [2021-03-26 10:26:39,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:39,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:26:39,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776934079] [2021-03-26 10:26:39,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:26:39,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:39,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:26:39,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:26:39,719 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2021-03-26 10:26:39,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:39,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:39,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2021-03-26 10:26:39,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:39,744 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:26:39,744 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:39,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:39,744 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-26 10:26:39,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 60 flow [2021-03-26 10:26:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:26:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:26:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2021-03-26 10:26:39,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9118165784832452 [2021-03-26 10:26:39,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2021-03-26 10:26:39,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2021-03-26 10:26:39,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:39,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2021-03-26 10:26:39,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:39,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:39,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:39,754 INFO L185 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 517 transitions. [2021-03-26 10:26:39,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 60 flow [2021-03-26 10:26:39,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:26:39,756 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 62 flow [2021-03-26 10:26:39,756 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-26 10:26:39,756 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-26 10:26:39,756 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:39,756 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 62 flow [2021-03-26 10:26:39,757 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 62 flow [2021-03-26 10:26:39,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2021-03-26 10:26:39,765 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:26:39,765 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:26:39,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:39,766 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 10:26:40,408 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:26:40,583 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:26:40,697 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:26:40,805 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:26:40,821 INFO L154 LiptonReduction]: Checked pairs total: 639 [2021-03-26 10:26:40,822 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:26:40,822 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1066 [2021-03-26 10:26:40,829 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:26:40,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:40,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:40,830 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:40,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:26:40,830 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1197406363, now seen corresponding path program 1 times [2021-03-26 10:26:40,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:40,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83594645] [2021-03-26 10:26:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:40,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:40,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:40,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:40,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:40,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83594645] [2021-03-26 10:26:40,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:40,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:26:40,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263514523] [2021-03-26 10:26:40,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:26:40,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:26:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:26:40,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 192 [2021-03-26 10:26:40,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:40,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:40,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 192 [2021-03-26 10:26:40,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:41,011 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:26:41,011 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:26:41,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:41,011 INFO L132 encePairwiseOnDemand]: 189/192 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 10:26:41,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 21 transitions, 62 flow [2021-03-26 10:26:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:26:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:26:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 10:26:41,014 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9236111111111112 [2021-03-26 10:26:41,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 10:26:41,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 10:26:41,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:41,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 10:26:41,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:41,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:41,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:41,016 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 532 transitions. [2021-03-26 10:26:41,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 21 transitions, 62 flow [2021-03-26 10:26:41,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:41,017 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-26 10:26:41,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-26 10:26:41,017 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -15 predicate places. [2021-03-26 10:26:41,017 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:41,017 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:26:41,017 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-26 10:26:41,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-26 10:26:41,020 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 10:26:41,020 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 10:26:41,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:41,021 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-26 10:26:41,811 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2021-03-26 10:26:42,101 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 10:26:42,785 WARN L205 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2021-03-26 10:26:43,098 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 10:26:43,101 INFO L154 LiptonReduction]: Checked pairs total: 406 [2021-03-26 10:26:43,101 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:43,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2084 [2021-03-26 10:26:43,101 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2021-03-26 10:26:43,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:43,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:43,102 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:43,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:26:43,102 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash -412274464, now seen corresponding path program 1 times [2021-03-26 10:26:43,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:43,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033520958] [2021-03-26 10:26:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:43,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:43,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:43,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:43,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:43,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:43,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:43,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033520958] [2021-03-26 10:26:43,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:43,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:43,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443319576] [2021-03-26 10:26:43,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:43,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:43,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 193 [2021-03-26 10:26:43,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:43,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:43,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 193 [2021-03-26 10:26:43,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:43,193 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 10:26:43,193 INFO L130 PetriNetUnfolder]: For 11/18 co-relation queries the response was YES. [2021-03-26 10:26:43,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 26 events. 0/26 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 2/28 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:26:43,193 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 1 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2021-03-26 10:26:43,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 21 transitions, 71 flow [2021-03-26 10:26:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:26:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:26:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 683 transitions. [2021-03-26 10:26:43,195 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8847150259067358 [2021-03-26 10:26:43,195 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 683 transitions. [2021-03-26 10:26:43,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 683 transitions. [2021-03-26 10:26:43,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:43,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 683 transitions. [2021-03-26 10:26:43,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:43,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:43,198 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:43,198 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 683 transitions. [2021-03-26 10:26:43,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 21 transitions, 71 flow [2021-03-26 10:26:43,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:43,199 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 68 flow [2021-03-26 10:26:43,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-26 10:26:43,199 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -13 predicate places. [2021-03-26 10:26:43,199 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:43,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-26 10:26:43,200 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-26 10:26:43,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 68 flow [2021-03-26 10:26:43,203 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 10:26:43,203 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2021-03-26 10:26:43,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 20 events. 0/20 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:43,203 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-26 10:26:43,647 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-26 10:26:43,997 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-26 10:26:45,384 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 277 DAG size of output: 276 [2021-03-26 10:26:46,088 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 10:26:46,341 INFO L154 LiptonReduction]: Checked pairs total: 293 [2021-03-26 10:26:46,341 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:46,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3142 [2021-03-26 10:26:46,342 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 66 flow [2021-03-26 10:26:46,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:46,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:46,342 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:46,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:26:46,342 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash -564195314, now seen corresponding path program 1 times [2021-03-26 10:26:46,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:46,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884389991] [2021-03-26 10:26:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:46,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:46,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:26:46,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:46,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 10:26:46,517 INFO L142 QuantifierPusher]: treesize reduction 17, result has 57.5 percent of original size [2021-03-26 10:26:46,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:26:46,533 INFO L142 QuantifierPusher]: treesize reduction 17, result has 50.0 percent of original size [2021-03-26 10:26:46,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:26:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:46,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884389991] [2021-03-26 10:26:46,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:46,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:26:46,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048102428] [2021-03-26 10:26:46,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:26:46,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:26:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:26:46,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 194 [2021-03-26 10:26:46,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:46,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:46,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 194 [2021-03-26 10:26:46,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:46,736 INFO L129 PetriNetUnfolder]: 54/136 cut-off events. [2021-03-26 10:26:46,736 INFO L130 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2021-03-26 10:26:46,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 136 events. 54/136 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 531 event pairs, 29 based on Foata normal form. 4/138 useless extension candidates. Maximal degree in co-relation 318. Up to 89 conditions per place. [2021-03-26 10:26:46,738 INFO L132 encePairwiseOnDemand]: 186/194 looper letters, 11 selfloop transitions, 9 changer transitions 0/28 dead transitions. [2021-03-26 10:26:46,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 132 flow [2021-03-26 10:26:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:26:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:26:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2021-03-26 10:26:46,742 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6721649484536083 [2021-03-26 10:26:46,742 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2021-03-26 10:26:46,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2021-03-26 10:26:46,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:46,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2021-03-26 10:26:46,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:46,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:46,745 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:46,745 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 66 flow. Second operand 5 states and 652 transitions. [2021-03-26 10:26:46,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 132 flow [2021-03-26 10:26:46,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:26:46,746 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 107 flow [2021-03-26 10:26:46,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-26 10:26:46,747 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -12 predicate places. [2021-03-26 10:26:46,747 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:46,747 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 107 flow [2021-03-26 10:26:46,747 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 107 flow [2021-03-26 10:26:46,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 107 flow [2021-03-26 10:26:46,756 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-03-26 10:26:46,756 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-26 10:26:46,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 47 events. 7/47 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 151 event pairs, 3 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 107. Up to 17 conditions per place. [2021-03-26 10:26:46,757 INFO L142 LiptonReduction]: Number of co-enabled transitions 168 [2021-03-26 10:26:50,399 INFO L154 LiptonReduction]: Checked pairs total: 227 [2021-03-26 10:26:50,399 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:50,399 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3652 [2021-03-26 10:26:50,400 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 109 flow [2021-03-26 10:26:50,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:50,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:50,400 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:50,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:26:50,400 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash 595512367, now seen corresponding path program 1 times [2021-03-26 10:26:50,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:50,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844751851] [2021-03-26 10:26:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:50,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:50,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:26:50,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:50,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 10:26:50,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:50,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:26:50,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:50,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:26:50,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:50,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:26:50,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:50,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:26:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:50,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844751851] [2021-03-26 10:26:50,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:50,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:26:50,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437955862] [2021-03-26 10:26:50,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:26:50,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:26:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:26:50,608 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 195 [2021-03-26 10:26:50,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 109 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:50,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:50,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 195 [2021-03-26 10:26:50,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:50,821 INFO L129 PetriNetUnfolder]: 58/163 cut-off events. [2021-03-26 10:26:50,821 INFO L130 PetriNetUnfolder]: For 165/167 co-relation queries the response was YES. [2021-03-26 10:26:50,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 163 events. 58/163 cut-off events. For 165/167 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 777 event pairs, 12 based on Foata normal form. 10/169 useless extension candidates. Maximal degree in co-relation 423. Up to 50 conditions per place. [2021-03-26 10:26:50,825 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 14 selfloop transitions, 3 changer transitions 13/38 dead transitions. [2021-03-26 10:26:50,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 213 flow [2021-03-26 10:26:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:26:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:26:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2021-03-26 10:26:50,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6328205128205128 [2021-03-26 10:26:50,828 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2021-03-26 10:26:50,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2021-03-26 10:26:50,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:50,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2021-03-26 10:26:50,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:50,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:50,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:50,833 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 109 flow. Second operand 5 states and 617 transitions. [2021-03-26 10:26:50,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 213 flow [2021-03-26 10:26:50,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:26:50,836 INFO L241 Difference]: Finished difference. Result has 41 places, 21 transitions, 102 flow [2021-03-26 10:26:50,837 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2021-03-26 10:26:50,837 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2021-03-26 10:26:50,837 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:50,837 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 21 transitions, 102 flow [2021-03-26 10:26:50,837 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 21 transitions, 102 flow [2021-03-26 10:26:50,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 21 transitions, 102 flow [2021-03-26 10:26:50,843 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2021-03-26 10:26:50,843 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2021-03-26 10:26:50,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 30 events. 3/30 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 2 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 79. Up to 11 conditions per place. [2021-03-26 10:26:50,844 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 10:26:51,468 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-26 10:26:52,025 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:26:52,781 WARN L205 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-03-26 10:26:53,473 WARN L205 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:26:56,120 INFO L154 LiptonReduction]: Checked pairs total: 149 [2021-03-26 10:26:56,120 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:26:56,120 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5283 [2021-03-26 10:26:56,121 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 105 flow [2021-03-26 10:26:56,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:56,121 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:56,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:26:56,122 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -817635197, now seen corresponding path program 1 times [2021-03-26 10:26:56,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:56,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693517936] [2021-03-26 10:26:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:56,187 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 10:26:56,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:26:56,213 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 10:26:56,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:26:56,218 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 10:26:56,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 10:26:56,252 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.3 percent of original size [2021-03-26 10:26:56,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-03-26 10:26:56,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 10:26:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:56,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693517936] [2021-03-26 10:26:56,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:56,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:26:56,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625078101] [2021-03-26 10:26:56,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:26:56,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:26:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:26:56,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 197 [2021-03-26 10:26:56,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 20 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:56,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 197 [2021-03-26 10:26:56,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:56,439 INFO L129 PetriNetUnfolder]: 34/100 cut-off events. [2021-03-26 10:26:56,439 INFO L130 PetriNetUnfolder]: For 236/241 co-relation queries the response was YES. [2021-03-26 10:26:56,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 100 events. 34/100 cut-off events. For 236/241 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 384 event pairs, 9 based on Foata normal form. 4/103 useless extension candidates. Maximal degree in co-relation 346. Up to 58 conditions per place. [2021-03-26 10:26:56,440 INFO L132 encePairwiseOnDemand]: 189/197 looper letters, 16 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2021-03-26 10:26:56,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 207 flow [2021-03-26 10:26:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:26:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:26:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2021-03-26 10:26:56,443 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7045685279187818 [2021-03-26 10:26:56,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2021-03-26 10:26:56,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2021-03-26 10:26:56,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:56,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2021-03-26 10:26:56,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,447 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,447 INFO L185 Difference]: Start difference. First operand has 39 places, 20 transitions, 105 flow. Second operand 5 states and 694 transitions. [2021-03-26 10:26:56,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 207 flow [2021-03-26 10:26:56,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 159 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-03-26 10:26:56,450 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 132 flow [2021-03-26 10:26:56,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-26 10:26:56,451 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-26 10:26:56,451 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:56,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 132 flow [2021-03-26 10:26:56,451 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 132 flow [2021-03-26 10:26:56,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 132 flow [2021-03-26 10:26:56,460 INFO L129 PetriNetUnfolder]: 8/47 cut-off events. [2021-03-26 10:26:56,460 INFO L130 PetriNetUnfolder]: For 53/58 co-relation queries the response was YES. [2021-03-26 10:26:56,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 47 events. 8/47 cut-off events. For 53/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 146 event pairs, 2 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 118. Up to 14 conditions per place. [2021-03-26 10:26:56,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 10:26:56,493 INFO L154 LiptonReduction]: Checked pairs total: 98 [2021-03-26 10:26:56,493 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:26:56,493 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 10:26:56,494 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 132 flow [2021-03-26 10:26:56,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:56,495 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:56,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:26:56,495 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -618206207, now seen corresponding path program 1 times [2021-03-26 10:26:56,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:56,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114856233] [2021-03-26 10:26:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:56,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:56,562 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:26:56,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:26:56,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:56,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114856233] [2021-03-26 10:26:56,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:56,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:56,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469576419] [2021-03-26 10:26:56,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:56,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:56,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:56,572 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 197 [2021-03-26 10:26:56,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:56,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 197 [2021-03-26 10:26:56,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:56,612 INFO L129 PetriNetUnfolder]: 64/168 cut-off events. [2021-03-26 10:26:56,612 INFO L130 PetriNetUnfolder]: For 91/107 co-relation queries the response was YES. [2021-03-26 10:26:56,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 168 events. 64/168 cut-off events. For 91/107 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 821 event pairs, 24 based on Foata normal form. 23/177 useless extension candidates. Maximal degree in co-relation 395. Up to 91 conditions per place. [2021-03-26 10:26:56,613 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 8 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-26 10:26:56,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 184 flow [2021-03-26 10:26:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:26:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:26:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2021-03-26 10:26:56,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8862944162436548 [2021-03-26 10:26:56,616 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2021-03-26 10:26:56,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2021-03-26 10:26:56,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:56,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2021-03-26 10:26:56,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,619 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,619 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 132 flow. Second operand 5 states and 873 transitions. [2021-03-26 10:26:56,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 184 flow [2021-03-26 10:26:56,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 183 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:26:56,620 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 191 flow [2021-03-26 10:26:56,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-26 10:26:56,620 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2021-03-26 10:26:56,621 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:56,621 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 191 flow [2021-03-26 10:26:56,621 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 191 flow [2021-03-26 10:26:56,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 191 flow [2021-03-26 10:26:56,635 INFO L129 PetriNetUnfolder]: 67/169 cut-off events. [2021-03-26 10:26:56,635 INFO L130 PetriNetUnfolder]: For 172/201 co-relation queries the response was YES. [2021-03-26 10:26:56,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 169 events. 67/169 cut-off events. For 172/201 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 813 event pairs, 26 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 501. Up to 99 conditions per place. [2021-03-26 10:26:56,636 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-26 10:26:56,641 INFO L154 LiptonReduction]: Checked pairs total: 137 [2021-03-26 10:26:56,641 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:56,641 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:26:56,641 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 185 flow [2021-03-26 10:26:56,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:56,642 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:56,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:26:56,642 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 416130185, now seen corresponding path program 1 times [2021-03-26 10:26:56,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:56,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345646414] [2021-03-26 10:26:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:56,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:56,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:56,727 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:26:56,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:26:56,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:56,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345646414] [2021-03-26 10:26:56,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:56,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:26:56,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312491111] [2021-03-26 10:26:56,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:26:56,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:26:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:26:56,739 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 197 [2021-03-26 10:26:56,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:56,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 197 [2021-03-26 10:26:56,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:56,829 INFO L129 PetriNetUnfolder]: 32/110 cut-off events. [2021-03-26 10:26:56,829 INFO L130 PetriNetUnfolder]: For 162/226 co-relation queries the response was YES. [2021-03-26 10:26:56,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 110 events. 32/110 cut-off events. For 162/226 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 448 event pairs, 4 based on Foata normal form. 38/144 useless extension candidates. Maximal degree in co-relation 389. Up to 64 conditions per place. [2021-03-26 10:26:56,830 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 5 selfloop transitions, 11 changer transitions 3/39 dead transitions. [2021-03-26 10:26:56,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 263 flow [2021-03-26 10:26:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:26:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:26:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1047 transitions. [2021-03-26 10:26:56,832 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8857868020304569 [2021-03-26 10:26:56,832 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1047 transitions. [2021-03-26 10:26:56,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1047 transitions. [2021-03-26 10:26:56,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:56,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1047 transitions. [2021-03-26 10:26:56,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,836 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,836 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 185 flow. Second operand 6 states and 1047 transitions. [2021-03-26 10:26:56,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 263 flow [2021-03-26 10:26:56,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:56,838 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 249 flow [2021-03-26 10:26:56,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2021-03-26 10:26:56,838 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2021-03-26 10:26:56,838 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:56,838 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 249 flow [2021-03-26 10:26:56,838 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 249 flow [2021-03-26 10:26:56,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 249 flow [2021-03-26 10:26:56,853 INFO L129 PetriNetUnfolder]: 31/107 cut-off events. [2021-03-26 10:26:56,853 INFO L130 PetriNetUnfolder]: For 225/240 co-relation queries the response was YES. [2021-03-26 10:26:56,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 107 events. 31/107 cut-off events. For 225/240 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 449 event pairs, 5 based on Foata normal form. 3/107 useless extension candidates. Maximal degree in co-relation 409. Up to 63 conditions per place. [2021-03-26 10:26:56,854 INFO L142 LiptonReduction]: Number of co-enabled transitions 196 [2021-03-26 10:26:56,858 INFO L154 LiptonReduction]: Checked pairs total: 136 [2021-03-26 10:26:56,858 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:56,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:26:56,859 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 241 flow [2021-03-26 10:26:56,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:56,859 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:56,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:26:56,859 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1729242401, now seen corresponding path program 1 times [2021-03-26 10:26:56,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:56,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143102652] [2021-03-26 10:26:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:56,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:56,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:56,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:56,954 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:26:56,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:26:56,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:56,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:56,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143102652] [2021-03-26 10:26:56,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:56,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:26:56,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129712337] [2021-03-26 10:26:56,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:26:56,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:26:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:26:56,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 197 [2021-03-26 10:26:56,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:56,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:56,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 197 [2021-03-26 10:26:56,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:57,029 INFO L129 PetriNetUnfolder]: 17/68 cut-off events. [2021-03-26 10:26:57,029 INFO L130 PetriNetUnfolder]: For 187/225 co-relation queries the response was YES. [2021-03-26 10:26:57,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 68 events. 17/68 cut-off events. For 187/225 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 1 based on Foata normal form. 30/95 useless extension candidates. Maximal degree in co-relation 275. Up to 36 conditions per place. [2021-03-26 10:26:57,030 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 2 selfloop transitions, 11 changer transitions 3/36 dead transitions. [2021-03-26 10:26:57,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 36 transitions, 273 flow [2021-03-26 10:26:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:26:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:26:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1215 transitions. [2021-03-26 10:26:57,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8810732414793329 [2021-03-26 10:26:57,034 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1215 transitions. [2021-03-26 10:26:57,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1215 transitions. [2021-03-26 10:26:57,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:57,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1215 transitions. [2021-03-26 10:26:57,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.57142857142858) internal successors, (1215), 7 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:57,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:57,039 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:57,039 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 241 flow. Second operand 7 states and 1215 transitions. [2021-03-26 10:26:57,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 36 transitions, 273 flow [2021-03-26 10:26:57,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 242 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 10:26:57,043 INFO L241 Difference]: Finished difference. Result has 50 places, 33 transitions, 222 flow [2021-03-26 10:26:57,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2021-03-26 10:26:57,043 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2021-03-26 10:26:57,043 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:57,043 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 33 transitions, 222 flow [2021-03-26 10:26:57,043 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 33 transitions, 222 flow [2021-03-26 10:26:57,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 33 transitions, 222 flow [2021-03-26 10:26:57,051 INFO L129 PetriNetUnfolder]: 15/64 cut-off events. [2021-03-26 10:26:57,052 INFO L130 PetriNetUnfolder]: For 127/128 co-relation queries the response was YES. [2021-03-26 10:26:57,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 64 events. 15/64 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 224 event pairs, 1 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 232. Up to 23 conditions per place. [2021-03-26 10:26:57,052 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-26 10:26:58,652 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 298 DAG size of output: 246 [2021-03-26 10:26:59,053 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2021-03-26 10:27:02,528 WARN L205 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 406 DAG size of output: 326 [2021-03-26 10:27:03,381 WARN L205 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 301 [2021-03-26 10:27:03,845 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2021-03-26 10:27:04,293 WARN L205 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2021-03-26 10:27:05,181 WARN L205 SmtUtils]: Spent 885.00 ms on a formula simplification that was a NOOP. DAG size: 311 [2021-03-26 10:27:06,111 WARN L205 SmtUtils]: Spent 928.00 ms on a formula simplification that was a NOOP. DAG size: 311 [2021-03-26 10:27:06,116 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-26 10:27:06,116 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:27:06,116 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9073 [2021-03-26 10:27:06,116 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 208 flow [2021-03-26 10:27:06,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:06,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:06,117 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:06,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:27:06,117 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash 629427626, now seen corresponding path program 1 times [2021-03-26 10:27:06,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:06,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103917083] [2021-03-26 10:27:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:27:06,172 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:27:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:27:06,238 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:27:06,279 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:27:06,280 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:27:06,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:27:06,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:27:06 BasicIcfg [2021-03-26 10:27:06,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:27:06,392 INFO L168 Benchmark]: Toolchain (without parser) took 67550.99 ms. Allocated memory was 329.3 MB in the beginning and 826.3 MB in the end (delta: 497.0 MB). Free memory was 291.0 MB in the beginning and 673.9 MB in the end (delta: -382.9 MB). Peak memory consumption was 117.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:06,392 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 329.3 MB. Free memory was 310.2 MB in the beginning and 310.1 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:27:06,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.22 ms. Allocated memory is still 329.3 MB. Free memory was 290.8 MB in the beginning and 286.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:06,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.16 ms. Allocated memory is still 329.3 MB. Free memory was 286.1 MB in the beginning and 281.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:06,393 INFO L168 Benchmark]: Boogie Preprocessor took 26.16 ms. Allocated memory is still 329.3 MB. Free memory was 281.9 MB in the beginning and 279.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:06,393 INFO L168 Benchmark]: RCFGBuilder took 2320.50 ms. Allocated memory was 329.3 MB in the beginning and 421.5 MB in the end (delta: 92.3 MB). Free memory was 278.8 MB in the beginning and 266.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 166.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:06,393 INFO L168 Benchmark]: TraceAbstraction took 64691.81 ms. Allocated memory was 421.5 MB in the beginning and 826.3 MB in the end (delta: 404.8 MB). Free memory was 266.9 MB in the beginning and 673.9 MB in the end (delta: -407.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:27:06,394 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.53 ms. Allocated memory is still 329.3 MB. Free memory was 310.2 MB in the beginning and 310.1 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 467.22 ms. Allocated memory is still 329.3 MB. Free memory was 290.8 MB in the beginning and 286.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.16 ms. Allocated memory is still 329.3 MB. Free memory was 286.1 MB in the beginning and 281.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.16 ms. Allocated memory is still 329.3 MB. Free memory was 281.9 MB in the beginning and 279.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2320.50 ms. Allocated memory was 329.3 MB in the beginning and 421.5 MB in the end (delta: 92.3 MB). Free memory was 278.8 MB in the beginning and 266.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 166.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 64691.81 ms. Allocated memory was 421.5 MB in the beginning and 826.3 MB in the end (delta: 404.8 MB). Free memory was 266.9 MB in the beginning and 673.9 MB in the end (delta: -407.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: 23998.4ms, 108 PlacesBefore, 47 PlacesAfterwards, 99 TransitionsBefore, 38 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 63 TotalNumberOfCompositions, 1971 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 974, positive: 896, positive conditional: 896, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 974, positive: 896, positive conditional: 0, positive unconditional: 896, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 974, positive: 896, positive conditional: 0, positive unconditional: 896, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 685, positive: 654, positive conditional: 0, positive unconditional: 654, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 685, positive: 646, positive conditional: 0, positive unconditional: 646, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11883, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 219, negative conditional: 0, negative unconditional: 219, unknown: 11647, unknown conditional: 0, unknown unconditional: 11647] ], Cache Queries: [ total: 974, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 685, unknown conditional: 0, unknown unconditional: 685] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 654, Positive conditional cache size: 0, Positive unconditional cache size: 654, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13286.5ms, 44 PlacesBefore, 31 PlacesAfterwards, 36 TransitionsBefore, 24 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 965 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, positive: 284, positive conditional: 284, positive unconditional: 0, negative: 77, negative conditional: 77, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, positive: 284, positive conditional: 0, positive unconditional: 284, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, positive: 284, positive conditional: 0, positive unconditional: 284, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8445, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 166, negative conditional: 0, negative unconditional: 166, unknown: 8264, unknown conditional: 0, unknown unconditional: 8264] ], Cache Queries: [ total: 361, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 709, Positive conditional cache size: 0, Positive unconditional cache size: 709, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1064.9ms, 34 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 639 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, positive: 183, positive conditional: 183, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 54, negative conditional: 0, negative unconditional: 54, 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: 237, positive: 180, positive conditional: 0, positive unconditional: 180, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 712, Positive conditional cache size: 0, Positive unconditional cache size: 712, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2083.6ms, 32 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 406 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 716, Positive conditional cache size: 0, Positive unconditional cache size: 716, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3141.4ms, 34 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 293 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 344, negative conditional: 0, negative unconditional: 344, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 718, Positive conditional cache size: 0, Positive unconditional cache size: 718, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3651.9ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 227 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, positive: 64, positive conditional: 2, positive unconditional: 62, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 64, positive conditional: 2, positive unconditional: 62, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 1, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3609, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3597, unknown conditional: 0, unknown unconditional: 3597] ], Cache Queries: [ total: 82, positive: 57, positive conditional: 1, positive unconditional: 56, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 725, Positive conditional cache size: 1, Positive unconditional cache size: 724, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5283.0ms, 41 PlacesBefore, 39 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 149 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 67, positive conditional: 67, 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: 84, positive: 67, positive conditional: 21, positive unconditional: 46, 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: 84, positive: 67, positive conditional: 21, positive unconditional: 46, 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: 13, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2695, positive: 207, positive conditional: 207, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2488, unknown conditional: 0, unknown unconditional: 2488] ], Cache Queries: [ total: 84, positive: 56, positive conditional: 11, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 736, Positive conditional cache size: 11, Positive unconditional cache size: 725, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.2ms, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 98 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 31, positive conditional: 31, 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: 41, positive: 31, positive conditional: 10, positive unconditional: 21, 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: 41, positive: 31, positive conditional: 10, positive unconditional: 21, 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: 3, positive: 3, positive conditional: 3, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 28, positive conditional: 7, positive unconditional: 21, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 739, Positive conditional cache size: 14, Positive unconditional cache size: 725, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 137 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, positive: 11, positive conditional: 8, positive unconditional: 3, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 11, positive conditional: 8, positive unconditional: 3, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, 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: 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: 23, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 746, Positive conditional cache size: 18, Positive unconditional cache size: 728, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.7ms, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 136 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, positive: 76, positive conditional: 62, positive unconditional: 14, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 76, positive conditional: 62, positive unconditional: 14, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 88, positive: 72, positive conditional: 60, positive unconditional: 12, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 815, Positive cache size: 750, Positive conditional cache size: 20, Positive unconditional cache size: 730, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9072.5ms, 50 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 817, Positive cache size: 752, Positive conditional cache size: 22, Positive unconditional cache size: 730, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1792; [L853] FCALL, FORK 0 pthread_create(&t1792, ((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_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$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_p1_EAX=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={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L766] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L767] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L770] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 [L779] 1 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_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$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7: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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L854] 0 pthread_t t1793; [L855] FCALL, FORK 0 pthread_create(&t1793, ((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_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$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7: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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 t1794; [L791] 2 __unbuffered_p1_EAX = x [L794] 2 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_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$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7: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_p1_EAX=1, __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=6, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L857] FCALL, FORK 0 pthread_create(&t1794, ((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_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$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7: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_p1_EAX=1, __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=6, weak$$choice1=0, weak$$choice2=0, x=1, y={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L816] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L817] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L818] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L819] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L820] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L821] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 [L827] 3 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_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$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7: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_p1_EAX=1, __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=9, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L830] 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) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] 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) [L830] 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) [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 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 [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L834] 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 [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L863] 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) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] 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) [L863] 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) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 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 [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L867] 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 [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] 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) [L874] EXPR 0 \read(y) [L874] 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) [L874] 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) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 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}, __unbuffered_cnt=3, __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_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$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7: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_p1_EAX=1, __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=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=255, weak$$choice2=255, x=1, y={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 4 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 64451.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 943.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 24081.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 27 SDtfs, 22 SDslu, 18 SDs, 0 SdLazy, 265 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 367.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 402.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.2ms SsaConstructionTime, 571.0ms SatisfiabilityAnalysisTime, 849.3ms InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 1040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...