/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 11:03:23,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 11:03:23,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 11:03:23,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 11:03:23,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 11:03:23,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 11:03:23,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 11:03:23,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 11:03:23,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 11:03:23,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 11:03:23,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 11:03:23,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 11:03:23,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 11:03:23,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 11:03:23,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 11:03:23,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 11:03:23,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 11:03:23,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 11:03:23,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 11:03:23,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 11:03:23,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 11:03:23,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 11:03:23,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 11:03:23,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 11:03:23,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 11:03:23,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 11:03:23,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 11:03:23,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 11:03:23,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 11:03:23,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 11:03:23,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 11:03:23,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 11:03:23,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 11:03:23,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 11:03:23,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 11:03:23,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 11:03:23,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 11:03:23,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 11:03:23,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 11:03:23,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 11:03:23,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 11:03:23,470 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-VariableLbe.epf [2021-03-24 11:03:23,500 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 11:03:23,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 11:03:23,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 11:03:23,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 11:03:23,501 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 11:03:23,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 11:03:23,501 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 11:03:23,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 11:03:23,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 11:03:23,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 11:03:23,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 11:03:23,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 11:03:23,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 11:03:23,504 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 11:03:23,504 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 11:03:23,504 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 11:03:23,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 11:03:23,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 11:03:23,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 11:03:23,505 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 11:03:23,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 11:03:23,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 11:03:23,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 11:03:23,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 11:03:23,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 11:03:23,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 11:03:23,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 11:03:23,506 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 11:03:23,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 11:03:23,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-24 11:03:23,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 11:03:23,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 11:03:23,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 11:03:23,794 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 11:03:23,795 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 11:03:23,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.opt.i [2021-03-24 11:03:23,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2fd5d42/396cf9f1ba2a4741ab9458ab41ef79f1/FLAG4538645f2 [2021-03-24 11:03:24,275 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 11:03:24,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_rmo.opt.i [2021-03-24 11:03:24,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2fd5d42/396cf9f1ba2a4741ab9458ab41ef79f1/FLAG4538645f2 [2021-03-24 11:03:24,675 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2fd5d42/396cf9f1ba2a4741ab9458ab41ef79f1 [2021-03-24 11:03:24,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 11:03:24,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 11:03:24,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 11:03:24,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 11:03:24,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 11:03:24,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 11:03:24" (1/1) ... [2021-03-24 11:03:24,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3d8983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:24, skipping insertion in model container [2021-03-24 11:03:24,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 11:03:24" (1/1) ... [2021-03-24 11:03:24,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 11:03:24,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 11:03:24,826 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/safe015_rmo.opt.i[992,1005] [2021-03-24 11:03:25,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 11:03:25,082 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 11:03:25,089 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/safe015_rmo.opt.i[992,1005] [2021-03-24 11:03:25,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 11:03:25,213 INFO L208 MainTranslator]: Completed translation [2021-03-24 11:03:25,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25 WrapperNode [2021-03-24 11:03:25,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 11:03:25,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 11:03:25,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 11:03:25,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 11:03:25,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 11:03:25,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 11:03:25,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 11:03:25,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 11:03:25,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (1/1) ... [2021-03-24 11:03:25,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 11:03:25,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 11:03:25,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 11:03:25,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 11:03:25,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (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-24 11:03:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-24 11:03:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 11:03:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 11:03:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 11:03:25,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 11:03:25,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 11:03:25,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 11:03:25,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 11:03:25,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 11:03:25,395 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 11:03:27,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 11:03:27,655 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-24 11:03:27,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 11:03:27 BoogieIcfgContainer [2021-03-24 11:03:27,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 11:03:27,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 11:03:27,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 11:03:27,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 11:03:27,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 11:03:24" (1/3) ... [2021-03-24 11:03:27,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d10688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 11:03:27, skipping insertion in model container [2021-03-24 11:03:27,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:03:25" (2/3) ... [2021-03-24 11:03:27,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d10688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 11:03:27, skipping insertion in model container [2021-03-24 11:03:27,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 11:03:27" (3/3) ... [2021-03-24 11:03:27,661 INFO L111 eAbstractionObserver]: Analyzing ICFG safe015_rmo.opt.i [2021-03-24 11:03:27,665 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 11:03:27,668 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-24 11:03:27,668 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,727 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,727 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,730 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:03:27,736 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 11:03:27,747 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-24 11:03:27,759 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 11:03:27,759 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 11:03:27,759 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 11:03:27,759 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 11:03:27,759 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 11:03:27,759 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 11:03:27,759 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 11:03:27,759 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 11:03:27,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2021-03-24 11:03:27,792 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-24 11:03:27,792 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:03:27,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2021-03-24 11:03:27,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2021-03-24 11:03:27,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 98 transitions, 205 flow [2021-03-24 11:03:27,798 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 11:03:27,804 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 98 transitions, 205 flow [2021-03-24 11:03:27,805 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 98 transitions, 205 flow [2021-03-24 11:03:27,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 98 transitions, 205 flow [2021-03-24 11:03:27,828 INFO L129 PetriNetUnfolder]: 1/98 cut-off events. [2021-03-24 11:03:27,828 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:03:27,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 1/98 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/97 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-24 11:03:27,830 INFO L142 LiptonReduction]: Number of co-enabled transitions 1018 [2021-03-24 11:03:28,488 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-24 11:03:28,843 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-24 11:03:28,959 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-24 11:03:29,754 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-24 11:03:30,028 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-24 11:03:31,386 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-24 11:03:31,979 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-24 11:03:33,286 WARN L205 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2021-03-24 11:03:33,654 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-24 11:03:35,243 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 370 DAG size of output: 325 [2021-03-24 11:03:35,968 WARN L205 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 322 [2021-03-24 11:03:36,168 INFO L154 LiptonReduction]: Checked pairs total: 1744 [2021-03-24 11:03:36,168 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-24 11:03:36,170 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8372 [2021-03-24 11:03:36,184 INFO L129 PetriNetUnfolder]: 1/40 cut-off events. [2021-03-24 11:03:36,184 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:03:36,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:36,185 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:36,185 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash 763452006, now seen corresponding path program 1 times [2021-03-24 11:03:36,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:36,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016874073] [2021-03-24 11:03:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:36,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:36,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:36,373 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-24 11:03:36,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016874073] [2021-03-24 11:03:36,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:36,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 11:03:36,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934042378] [2021-03-24 11:03:36,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-03-24 11:03:36,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:36,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-03-24 11:03:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-03-24 11:03:36,391 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 172 [2021-03-24 11:03:36,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 2 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-24 11:03:36,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:36,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 172 [2021-03-24 11:03:36,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:36,412 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-24 11:03:36,412 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:03:36,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 39 events. 0/39 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/40 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-24 11:03:36,414 INFO L132 encePairwiseOnDemand]: 171/172 looper letters, 0 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2021-03-24 11:03:36,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 87 flow [2021-03-24 11:03:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-24 11:03:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-03-24 11:03:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2021-03-24 11:03:36,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9738372093023255 [2021-03-24 11:03:36,426 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 335 transitions. [2021-03-24 11:03:36,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 335 transitions. [2021-03-24 11:03:36,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:36,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 335 transitions. [2021-03-24 11:03:36,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-24 11:03:36,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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-24 11:03:36,439 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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-24 11:03:36,441 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 2 states and 335 transitions. [2021-03-24 11:03:36,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 87 flow [2021-03-24 11:03:36,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-24 11:03:36,444 INFO L241 Difference]: Finished difference. Result has 47 places, 39 transitions, 84 flow [2021-03-24 11:03:36,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2021-03-24 11:03:36,445 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-24 11:03:36,445 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 84 flow [2021-03-24 11:03:36,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-24 11:03:36,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:36,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:36,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 11:03:36,446 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:36,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 763216561, now seen corresponding path program 1 times [2021-03-24 11:03:36,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:36,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852587904] [2021-03-24 11:03:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:36,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:36,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:36,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:36,605 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-24 11:03:36,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852587904] [2021-03-24 11:03:36,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:36,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 11:03:36,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589933198] [2021-03-24 11:03:36,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:03:36,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:36,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:03:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:03:36,608 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 172 [2021-03-24 11:03:36,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-24 11:03:36,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:36,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 172 [2021-03-24 11:03:36,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:36,640 INFO L129 PetriNetUnfolder]: 6/64 cut-off events. [2021-03-24 11:03:36,641 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:03:36,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 64 events. 6/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 2 based on Foata normal form. 4/66 useless extension candidates. Maximal degree in co-relation 90. Up to 15 conditions per place. [2021-03-24 11:03:36,641 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 4 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2021-03-24 11:03:36,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 122 flow [2021-03-24 11:03:36,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:03:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:03:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 784 transitions. [2021-03-24 11:03:36,644 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9116279069767442 [2021-03-24 11:03:36,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 784 transitions. [2021-03-24 11:03:36,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 784 transitions. [2021-03-24 11:03:36,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:36,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 784 transitions. [2021-03-24 11:03:36,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 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-24 11:03:36,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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-24 11:03:36,648 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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-24 11:03:36,648 INFO L185 Difference]: Start difference. First operand has 47 places, 39 transitions, 84 flow. Second operand 5 states and 784 transitions. [2021-03-24 11:03:36,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 122 flow [2021-03-24 11:03:36,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-24 11:03:36,650 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 111 flow [2021-03-24 11:03:36,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-24 11:03:36,650 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2021-03-24 11:03:36,650 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 111 flow [2021-03-24 11:03:36,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-24 11:03:36,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:36,651 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:36,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 11:03:36,651 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1841051970, now seen corresponding path program 1 times [2021-03-24 11:03:36,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:36,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953906317] [2021-03-24 11:03:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:36,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:36,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:03:36,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 11:03:36,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-24 11:03:36,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-24 11:03:36,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-24 11:03:36,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-24 11:03:36,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:36,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 11:03:36,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:36,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:36,812 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-24 11:03:36,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953906317] [2021-03-24 11:03:36,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:36,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 11:03:36,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890498010] [2021-03-24 11:03:36,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 11:03:36,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 11:03:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-03-24 11:03:36,815 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 172 [2021-03-24 11:03:36,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 111 flow. Second operand has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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-24 11:03:36,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:36,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 172 [2021-03-24 11:03:36,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:37,119 INFO L129 PetriNetUnfolder]: 276/544 cut-off events. [2021-03-24 11:03:37,119 INFO L130 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2021-03-24 11:03:37,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 544 events. 276/544 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2496 event pairs, 167 based on Foata normal form. 27/561 useless extension candidates. Maximal degree in co-relation 1210. Up to 357 conditions per place. [2021-03-24 11:03:37,125 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 17 selfloop transitions, 7 changer transitions 10/57 dead transitions. [2021-03-24 11:03:37,125 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 213 flow [2021-03-24 11:03:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 11:03:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 11:03:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 948 transitions. [2021-03-24 11:03:37,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.688953488372093 [2021-03-24 11:03:37,129 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 948 transitions. [2021-03-24 11:03:37,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 948 transitions. [2021-03-24 11:03:37,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:37,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 948 transitions. [2021-03-24 11:03:37,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 0 states have call successors, (0), 0 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-24 11:03:37,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-24 11:03:37,133 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-24 11:03:37,133 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 111 flow. Second operand 8 states and 948 transitions. [2021-03-24 11:03:37,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 213 flow [2021-03-24 11:03:37,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 208 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 11:03:37,137 INFO L241 Difference]: Finished difference. Result has 60 places, 44 transitions, 148 flow [2021-03-24 11:03:37,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2021-03-24 11:03:37,137 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2021-03-24 11:03:37,137 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 148 flow [2021-03-24 11:03:37,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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-24 11:03:37,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:37,138 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:37,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 11:03:37,138 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:37,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1537014118, now seen corresponding path program 1 times [2021-03-24 11:03:37,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:37,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933233466] [2021-03-24 11:03:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:37,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:37,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:37,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:03:37,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 11:03:37,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:37,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:37,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:37,347 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-24 11:03:37,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933233466] [2021-03-24 11:03:37,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:37,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 11:03:37,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214834788] [2021-03-24 11:03:37,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 11:03:37,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 11:03:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-24 11:03:37,350 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 172 [2021-03-24 11:03:37,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:37,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:37,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 172 [2021-03-24 11:03:37,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:37,492 INFO L129 PetriNetUnfolder]: 267/528 cut-off events. [2021-03-24 11:03:37,492 INFO L130 PetriNetUnfolder]: For 586/586 co-relation queries the response was YES. [2021-03-24 11:03:37,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 528 events. 267/528 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2381 event pairs, 63 based on Foata normal form. 14/523 useless extension candidates. Maximal degree in co-relation 1529. Up to 313 conditions per place. [2021-03-24 11:03:37,496 INFO L132 encePairwiseOnDemand]: 160/172 looper letters, 20 selfloop transitions, 14 changer transitions 6/64 dead transitions. [2021-03-24 11:03:37,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 304 flow [2021-03-24 11:03:37,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 11:03:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 11:03:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 906 transitions. [2021-03-24 11:03:37,499 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7524916943521595 [2021-03-24 11:03:37,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 906 transitions. [2021-03-24 11:03:37,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 906 transitions. [2021-03-24 11:03:37,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:37,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 906 transitions. [2021-03-24 11:03:37,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 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-24 11:03:37,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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-24 11:03:37,504 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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-24 11:03:37,504 INFO L185 Difference]: Start difference. First operand has 60 places, 44 transitions, 148 flow. Second operand 7 states and 906 transitions. [2021-03-24 11:03:37,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 304 flow [2021-03-24 11:03:37,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 292 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-03-24 11:03:37,508 INFO L241 Difference]: Finished difference. Result has 62 places, 53 transitions, 241 flow [2021-03-24 11:03:37,509 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2021-03-24 11:03:37,509 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2021-03-24 11:03:37,509 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 241 flow [2021-03-24 11:03:37,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:37,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:37,509 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:37,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 11:03:37,510 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash -269728422, now seen corresponding path program 2 times [2021-03-24 11:03:37,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:37,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400569034] [2021-03-24 11:03:37,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:37,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:37,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:37,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:37,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:37,629 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-24 11:03:37,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400569034] [2021-03-24 11:03:37,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:37,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:03:37,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455900192] [2021-03-24 11:03:37,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:03:37,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:03:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:03:37,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 172 [2021-03-24 11:03:37,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:37,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:37,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 172 [2021-03-24 11:03:37,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:37,694 INFO L129 PetriNetUnfolder]: 75/260 cut-off events. [2021-03-24 11:03:37,694 INFO L130 PetriNetUnfolder]: For 559/733 co-relation queries the response was YES. [2021-03-24 11:03:37,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 260 events. 75/260 cut-off events. For 559/733 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1292 event pairs, 24 based on Foata normal form. 20/263 useless extension candidates. Maximal degree in co-relation 787. Up to 87 conditions per place. [2021-03-24 11:03:37,696 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 2 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2021-03-24 11:03:37,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 259 flow [2021-03-24 11:03:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-24 11:03:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-24 11:03:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions. [2021-03-24 11:03:37,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8982558139534884 [2021-03-24 11:03:37,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 927 transitions. [2021-03-24 11:03:37,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions. [2021-03-24 11:03:37,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:37,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions. [2021-03-24 11:03:37,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 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-24 11:03:37,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-24 11:03:37,701 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 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-24 11:03:37,701 INFO L185 Difference]: Start difference. First operand has 62 places, 53 transitions, 241 flow. Second operand 6 states and 927 transitions. [2021-03-24 11:03:37,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 259 flow [2021-03-24 11:03:37,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 245 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-24 11:03:37,704 INFO L241 Difference]: Finished difference. Result has 65 places, 53 transitions, 248 flow [2021-03-24 11:03:37,704 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2021-03-24 11:03:37,704 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2021-03-24 11:03:37,704 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 248 flow [2021-03-24 11:03:37,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:37,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:37,705 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:37,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 11:03:37,705 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -813328896, now seen corresponding path program 1 times [2021-03-24 11:03:37,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:37,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144370603] [2021-03-24 11:03:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:37,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:37,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:03:37,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 11:03:37,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-24 11:03:37,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 11:03:37,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 11:03:37,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-24 11:03:37,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:37,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 11:03:37,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 11:03:37,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:37,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:37,878 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-24 11:03:37,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144370603] [2021-03-24 11:03:37,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:37,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 11:03:37,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082668774] [2021-03-24 11:03:37,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 11:03:37,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:37,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 11:03:37,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-03-24 11:03:37,882 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 172 [2021-03-24 11:03:37,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 0 states have call successors, (0), 0 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-24 11:03:37,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:37,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 172 [2021-03-24 11:03:37,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:38,088 INFO L129 PetriNetUnfolder]: 261/570 cut-off events. [2021-03-24 11:03:38,089 INFO L130 PetriNetUnfolder]: For 1388/1390 co-relation queries the response was YES. [2021-03-24 11:03:38,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 570 events. 261/570 cut-off events. For 1388/1390 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2880 event pairs, 133 based on Foata normal form. 34/597 useless extension candidates. Maximal degree in co-relation 1972. Up to 346 conditions per place. [2021-03-24 11:03:38,092 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 25 selfloop transitions, 8 changer transitions 11/67 dead transitions. [2021-03-24 11:03:38,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 414 flow [2021-03-24 11:03:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 11:03:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 11:03:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 948 transitions. [2021-03-24 11:03:38,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.688953488372093 [2021-03-24 11:03:38,095 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 948 transitions. [2021-03-24 11:03:38,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 948 transitions. [2021-03-24 11:03:38,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:38,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 948 transitions. [2021-03-24 11:03:38,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.5) internal successors, (948), 8 states have internal predecessors, (948), 0 states have call successors, (0), 0 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-24 11:03:38,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-24 11:03:38,098 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-24 11:03:38,098 INFO L185 Difference]: Start difference. First operand has 65 places, 53 transitions, 248 flow. Second operand 8 states and 948 transitions. [2021-03-24 11:03:38,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 414 flow [2021-03-24 11:03:38,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 396 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-24 11:03:38,104 INFO L241 Difference]: Finished difference. Result has 71 places, 53 transitions, 261 flow [2021-03-24 11:03:38,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=261, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2021-03-24 11:03:38,104 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2021-03-24 11:03:38,104 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 261 flow [2021-03-24 11:03:38,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 0 states have call successors, (0), 0 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-24 11:03:38,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:38,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:38,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 11:03:38,105 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash -467918020, now seen corresponding path program 1 times [2021-03-24 11:03:38,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:38,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508563910] [2021-03-24 11:03:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:38,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:38,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:38,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:38,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:03:38,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:03:38,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 11:03:38,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:38,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:38,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-24 11:03:38,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:38,265 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-24 11:03:38,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508563910] [2021-03-24 11:03:38,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:38,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 11:03:38,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961301344] [2021-03-24 11:03:38,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 11:03:38,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 11:03:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-03-24 11:03:38,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 172 [2021-03-24 11:03:38,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 261 flow. Second operand has 10 states, 10 states have (on average 122.6) internal successors, (1226), 10 states have internal predecessors, (1226), 0 states have call successors, (0), 0 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-24 11:03:38,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:38,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 172 [2021-03-24 11:03:38,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:38,506 INFO L129 PetriNetUnfolder]: 249/565 cut-off events. [2021-03-24 11:03:38,506 INFO L130 PetriNetUnfolder]: For 2089/2089 co-relation queries the response was YES. [2021-03-24 11:03:38,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 565 events. 249/565 cut-off events. For 2089/2089 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 122 based on Foata normal form. 21/574 useless extension candidates. Maximal degree in co-relation 2078. Up to 277 conditions per place. [2021-03-24 11:03:38,509 INFO L132 encePairwiseOnDemand]: 159/172 looper letters, 21 selfloop transitions, 17 changer transitions 8/67 dead transitions. [2021-03-24 11:03:38,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 435 flow [2021-03-24 11:03:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 11:03:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 11:03:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1249 transitions. [2021-03-24 11:03:38,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7261627906976744 [2021-03-24 11:03:38,512 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1249 transitions. [2021-03-24 11:03:38,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1249 transitions. [2021-03-24 11:03:38,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:38,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1249 transitions. [2021-03-24 11:03:38,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.9) internal successors, (1249), 10 states have internal predecessors, (1249), 0 states have call successors, (0), 0 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-24 11:03:38,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:38,517 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:38,517 INFO L185 Difference]: Start difference. First operand has 71 places, 53 transitions, 261 flow. Second operand 10 states and 1249 transitions. [2021-03-24 11:03:38,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 435 flow [2021-03-24 11:03:38,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 396 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-24 11:03:38,521 INFO L241 Difference]: Finished difference. Result has 71 places, 56 transitions, 316 flow [2021-03-24 11:03:38,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=316, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2021-03-24 11:03:38,521 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2021-03-24 11:03:38,521 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 316 flow [2021-03-24 11:03:38,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 122.6) internal successors, (1226), 10 states have internal predecessors, (1226), 0 states have call successors, (0), 0 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-24 11:03:38,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:38,522 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:38,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 11:03:38,522 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash -368998728, now seen corresponding path program 2 times [2021-03-24 11:03:38,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:38,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177648957] [2021-03-24 11:03:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:38,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:38,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:03:38,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-24 11:03:38,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-24 11:03:38,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-24 11:03:38,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-24 11:03:38,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-24 11:03:38,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-24 11:03:38,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-24 11:03:38,729 INFO L142 QuantifierPusher]: treesize reduction 15, result has 66.7 percent of original size [2021-03-24 11:03:38,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-24 11:03:38,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:38,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:38,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:38,754 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-24 11:03:38,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177648957] [2021-03-24 11:03:38,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:38,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 11:03:38,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764531033] [2021-03-24 11:03:38,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 11:03:38,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 11:03:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-03-24 11:03:38,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 172 [2021-03-24 11:03:38,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 316 flow. Second operand has 10 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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-24 11:03:38,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:38,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 172 [2021-03-24 11:03:38,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:38,976 INFO L129 PetriNetUnfolder]: 232/526 cut-off events. [2021-03-24 11:03:38,976 INFO L130 PetriNetUnfolder]: For 1908/1910 co-relation queries the response was YES. [2021-03-24 11:03:38,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2085 conditions, 526 events. 232/526 cut-off events. For 1908/1910 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2690 event pairs, 130 based on Foata normal form. 14/534 useless extension candidates. Maximal degree in co-relation 2071. Up to 318 conditions per place. [2021-03-24 11:03:38,980 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 29 selfloop transitions, 13 changer transitions 6/70 dead transitions. [2021-03-24 11:03:38,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 505 flow [2021-03-24 11:03:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 11:03:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 11:03:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 989 transitions. [2021-03-24 11:03:38,983 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2021-03-24 11:03:38,983 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 989 transitions. [2021-03-24 11:03:38,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 989 transitions. [2021-03-24 11:03:38,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:38,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 989 transitions. [2021-03-24 11:03:38,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.88888888888889) internal successors, (989), 9 states have internal predecessors, (989), 0 states have call successors, (0), 0 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-24 11:03:38,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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-24 11:03:38,987 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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-24 11:03:38,987 INFO L185 Difference]: Start difference. First operand has 71 places, 56 transitions, 316 flow. Second operand 9 states and 989 transitions. [2021-03-24 11:03:38,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 505 flow [2021-03-24 11:03:38,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 470 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-03-24 11:03:38,990 INFO L241 Difference]: Finished difference. Result has 74 places, 59 transitions, 359 flow [2021-03-24 11:03:38,990 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2021-03-24 11:03:38,990 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2021-03-24 11:03:38,990 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 359 flow [2021-03-24 11:03:38,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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-24 11:03:38,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:38,991 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:38,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 11:03:38,991 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash 282416561, now seen corresponding path program 1 times [2021-03-24 11:03:38,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:38,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011751609] [2021-03-24 11:03:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:39,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:39,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:39,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:03:39,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:03:39,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:39,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:39,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:39,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:39,111 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-24 11:03:39,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011751609] [2021-03-24 11:03:39,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:39,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 11:03:39,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200912813] [2021-03-24 11:03:39,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 11:03:39,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 11:03:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-24 11:03:39,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 172 [2021-03-24 11:03:39,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 359 flow. Second operand has 8 states, 8 states have (on average 124.75) internal successors, (998), 8 states have internal predecessors, (998), 0 states have call successors, (0), 0 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-24 11:03:39,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:39,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 172 [2021-03-24 11:03:39,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:39,338 INFO L129 PetriNetUnfolder]: 293/650 cut-off events. [2021-03-24 11:03:39,338 INFO L130 PetriNetUnfolder]: For 2866/2876 co-relation queries the response was YES. [2021-03-24 11:03:39,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 650 events. 293/650 cut-off events. For 2866/2876 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3608 event pairs, 119 based on Foata normal form. 32/662 useless extension candidates. Maximal degree in co-relation 2653. Up to 364 conditions per place. [2021-03-24 11:03:39,343 INFO L132 encePairwiseOnDemand]: 162/172 looper letters, 31 selfloop transitions, 16 changer transitions 10/80 dead transitions. [2021-03-24 11:03:39,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 80 transitions, 635 flow [2021-03-24 11:03:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 11:03:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 11:03:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1146 transitions. [2021-03-24 11:03:39,346 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7403100775193798 [2021-03-24 11:03:39,346 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1146 transitions. [2021-03-24 11:03:39,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1146 transitions. [2021-03-24 11:03:39,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:39,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1146 transitions. [2021-03-24 11:03:39,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.33333333333333) internal successors, (1146), 9 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:39,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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-24 11:03:39,350 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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-24 11:03:39,350 INFO L185 Difference]: Start difference. First operand has 74 places, 59 transitions, 359 flow. Second operand 9 states and 1146 transitions. [2021-03-24 11:03:39,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 80 transitions, 635 flow [2021-03-24 11:03:39,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 80 transitions, 604 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-03-24 11:03:39,356 INFO L241 Difference]: Finished difference. Result has 78 places, 66 transitions, 458 flow [2021-03-24 11:03:39,356 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=458, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2021-03-24 11:03:39,356 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2021-03-24 11:03:39,356 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 458 flow [2021-03-24 11:03:39,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 124.75) internal successors, (998), 8 states have internal predecessors, (998), 0 states have call successors, (0), 0 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-24 11:03:39,356 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:39,357 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:39,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 11:03:39,357 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1248332471, now seen corresponding path program 2 times [2021-03-24 11:03:39,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:39,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233202005] [2021-03-24 11:03:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:39,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:39,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-24 11:03:39,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:39,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-24 11:03:39,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-24 11:03:39,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 11:03:39,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 11:03:39,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 11:03:39,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-24 11:03:39,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-24 11:03:39,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:39,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 11:03:39,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:39,519 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-24 11:03:39,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233202005] [2021-03-24 11:03:39,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:39,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-24 11:03:39,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191806621] [2021-03-24 11:03:39,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-24 11:03:39,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-24 11:03:39,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-03-24 11:03:39,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 172 [2021-03-24 11:03:39,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 458 flow. Second operand has 12 states, 12 states have (on average 111.25) internal successors, (1335), 12 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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-24 11:03:39,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:39,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 172 [2021-03-24 11:03:39,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:39,796 INFO L129 PetriNetUnfolder]: 263/630 cut-off events. [2021-03-24 11:03:39,796 INFO L130 PetriNetUnfolder]: For 3416/3426 co-relation queries the response was YES. [2021-03-24 11:03:39,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 630 events. 263/630 cut-off events. For 3416/3426 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3613 event pairs, 106 based on Foata normal form. 43/656 useless extension candidates. Maximal degree in co-relation 2668. Up to 317 conditions per place. [2021-03-24 11:03:39,801 INFO L132 encePairwiseOnDemand]: 162/172 looper letters, 31 selfloop transitions, 19 changer transitions 9/81 dead transitions. [2021-03-24 11:03:39,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 81 transitions, 712 flow [2021-03-24 11:03:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 11:03:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 11:03:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1135 transitions. [2021-03-24 11:03:39,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6598837209302325 [2021-03-24 11:03:39,803 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1135 transitions. [2021-03-24 11:03:39,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1135 transitions. [2021-03-24 11:03:39,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:39,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1135 transitions. [2021-03-24 11:03:39,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:39,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:39,809 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:39,809 INFO L185 Difference]: Start difference. First operand has 78 places, 66 transitions, 458 flow. Second operand 10 states and 1135 transitions. [2021-03-24 11:03:39,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 81 transitions, 712 flow [2021-03-24 11:03:39,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 657 flow, removed 25 selfloop flow, removed 5 redundant places. [2021-03-24 11:03:39,814 INFO L241 Difference]: Finished difference. Result has 83 places, 69 transitions, 511 flow [2021-03-24 11:03:39,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=511, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2021-03-24 11:03:39,815 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2021-03-24 11:03:39,815 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 511 flow [2021-03-24 11:03:39,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 111.25) internal successors, (1335), 12 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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-24 11:03:39,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:39,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:39,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 11:03:39,816 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -57951841, now seen corresponding path program 1 times [2021-03-24 11:03:39,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:39,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225175785] [2021-03-24 11:03:39,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:39,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:39,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:39,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:39,877 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:03:39,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:39,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:39,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:39,883 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-24 11:03:39,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225175785] [2021-03-24 11:03:39,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:39,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 11:03:39,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891549427] [2021-03-24 11:03:39,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:03:39,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:03:39,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:03:39,885 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-24 11:03:39,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 511 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:39,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:39,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-24 11:03:39,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:40,017 INFO L129 PetriNetUnfolder]: 344/811 cut-off events. [2021-03-24 11:03:40,017 INFO L130 PetriNetUnfolder]: For 2906/3004 co-relation queries the response was YES. [2021-03-24 11:03:40,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 811 events. 344/811 cut-off events. For 2906/3004 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 5388 event pairs, 108 based on Foata normal form. 58/809 useless extension candidates. Maximal degree in co-relation 2428. Up to 359 conditions per place. [2021-03-24 11:03:40,024 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 12 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2021-03-24 11:03:40,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 597 flow [2021-03-24 11:03:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 11:03:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 11:03:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1063 transitions. [2021-03-24 11:03:40,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.882890365448505 [2021-03-24 11:03:40,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1063 transitions. [2021-03-24 11:03:40,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1063 transitions. [2021-03-24 11:03:40,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:40,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1063 transitions. [2021-03-24 11:03:40,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.85714285714286) internal successors, (1063), 7 states have internal predecessors, (1063), 0 states have call successors, (0), 0 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-24 11:03:40,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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-24 11:03:40,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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-24 11:03:40,031 INFO L185 Difference]: Start difference. First operand has 83 places, 69 transitions, 511 flow. Second operand 7 states and 1063 transitions. [2021-03-24 11:03:40,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 597 flow [2021-03-24 11:03:40,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 556 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-03-24 11:03:40,037 INFO L241 Difference]: Finished difference. Result has 83 places, 81 transitions, 564 flow [2021-03-24 11:03:40,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=564, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2021-03-24 11:03:40,037 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2021-03-24 11:03:40,037 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 564 flow [2021-03-24 11:03:40,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:40,037 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:40,037 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:40,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 11:03:40,037 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1544261070, now seen corresponding path program 1 times [2021-03-24 11:03:40,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:40,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571112755] [2021-03-24 11:03:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:40,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:40,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:40,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-24 11:03:40,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:03:40,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:40,118 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-24 11:03:40,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571112755] [2021-03-24 11:03:40,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:40,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 11:03:40,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133364709] [2021-03-24 11:03:40,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 11:03:40,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:40,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 11:03:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 11:03:40,120 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 172 [2021-03-24 11:03:40,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 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-24 11:03:40,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:40,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 172 [2021-03-24 11:03:40,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:40,401 INFO L129 PetriNetUnfolder]: 548/1306 cut-off events. [2021-03-24 11:03:40,402 INFO L130 PetriNetUnfolder]: For 5916/6202 co-relation queries the response was YES. [2021-03-24 11:03:40,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 1306 events. 548/1306 cut-off events. For 5916/6202 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 9817 event pairs, 136 based on Foata normal form. 108/1317 useless extension candidates. Maximal degree in co-relation 5418. Up to 506 conditions per place. [2021-03-24 11:03:40,411 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 39 selfloop transitions, 17 changer transitions 33/126 dead transitions. [2021-03-24 11:03:40,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 1125 flow [2021-03-24 11:03:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 11:03:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 11:03:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1096 transitions. [2021-03-24 11:03:40,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7965116279069767 [2021-03-24 11:03:40,414 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1096 transitions. [2021-03-24 11:03:40,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1096 transitions. [2021-03-24 11:03:40,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:40,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1096 transitions. [2021-03-24 11:03:40,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:40,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-24 11:03:40,418 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-24 11:03:40,418 INFO L185 Difference]: Start difference. First operand has 83 places, 81 transitions, 564 flow. Second operand 8 states and 1096 transitions. [2021-03-24 11:03:40,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 1125 flow [2021-03-24 11:03:40,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 126 transitions, 1101 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-03-24 11:03:40,429 INFO L241 Difference]: Finished difference. Result has 95 places, 86 transitions, 690 flow [2021-03-24 11:03:40,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2021-03-24 11:03:40,430 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2021-03-24 11:03:40,430 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 690 flow [2021-03-24 11:03:40,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 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-24 11:03:40,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:40,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 11:03:40,439 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1032917226, now seen corresponding path program 1 times [2021-03-24 11:03:40,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:40,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489917143] [2021-03-24 11:03:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:40,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:40,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:40,515 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:03:40,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:40,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:40,523 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-24 11:03:40,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489917143] [2021-03-24 11:03:40,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:40,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 11:03:40,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43238636] [2021-03-24 11:03:40,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 11:03:40,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 11:03:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 11:03:40,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-24 11:03:40,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:40,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:40,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-24 11:03:40,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:40,672 INFO L129 PetriNetUnfolder]: 323/846 cut-off events. [2021-03-24 11:03:40,672 INFO L130 PetriNetUnfolder]: For 4824/6509 co-relation queries the response was YES. [2021-03-24 11:03:40,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 846 events. 323/846 cut-off events. For 4824/6509 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6164 event pairs, 24 based on Foata normal form. 660/1467 useless extension candidates. Maximal degree in co-relation 3745. Up to 401 conditions per place. [2021-03-24 11:03:40,679 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 7 selfloop transitions, 26 changer transitions 6/105 dead transitions. [2021-03-24 11:03:40,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 905 flow [2021-03-24 11:03:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 11:03:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 11:03:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1518 transitions. [2021-03-24 11:03:40,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825581395348837 [2021-03-24 11:03:40,681 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1518 transitions. [2021-03-24 11:03:40,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1518 transitions. [2021-03-24 11:03:40,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:40,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1518 transitions. [2021-03-24 11:03:40,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 151.8) internal successors, (1518), 10 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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-24 11:03:40,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:40,686 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:40,686 INFO L185 Difference]: Start difference. First operand has 95 places, 86 transitions, 690 flow. Second operand 10 states and 1518 transitions. [2021-03-24 11:03:40,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 905 flow [2021-03-24 11:03:40,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 896 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-24 11:03:40,694 INFO L241 Difference]: Finished difference. Result has 103 places, 99 transitions, 860 flow [2021-03-24 11:03:40,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=860, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2021-03-24 11:03:40,694 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2021-03-24 11:03:40,694 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 860 flow [2021-03-24 11:03:40,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:03:40,695 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:40,695 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:40,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-24 11:03:40,695 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:40,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2067985518, now seen corresponding path program 1 times [2021-03-24 11:03:40,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:40,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803951190] [2021-03-24 11:03:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:40,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:40,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:40,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:40,776 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:03:40,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:40,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:40,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:40,782 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-24 11:03:40,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803951190] [2021-03-24 11:03:40,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:40,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 11:03:40,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112439590] [2021-03-24 11:03:40,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 11:03:40,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:40,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 11:03:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 11:03:40,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-24 11:03:40,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 860 flow. Second operand has 7 states, 7 states have (on average 148.85714285714286) internal successors, (1042), 7 states have internal predecessors, (1042), 0 states have call successors, (0), 0 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-24 11:03:40,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:40,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-24 11:03:40,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:40,997 INFO L129 PetriNetUnfolder]: 255/727 cut-off events. [2021-03-24 11:03:40,997 INFO L130 PetriNetUnfolder]: For 7239/10710 co-relation queries the response was YES. [2021-03-24 11:03:41,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 727 events. 255/727 cut-off events. For 7239/10710 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 5431 event pairs, 5 based on Foata normal form. 754/1448 useless extension candidates. Maximal degree in co-relation 3786. Up to 354 conditions per place. [2021-03-24 11:03:41,003 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 3 selfloop transitions, 31 changer transitions 7/107 dead transitions. [2021-03-24 11:03:41,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 107 transitions, 1006 flow [2021-03-24 11:03:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 11:03:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 11:03:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1964 transitions. [2021-03-24 11:03:41,006 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8783542039355993 [2021-03-24 11:03:41,006 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1964 transitions. [2021-03-24 11:03:41,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1964 transitions. [2021-03-24 11:03:41,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:41,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1964 transitions. [2021-03-24 11:03:41,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 151.07692307692307) internal successors, (1964), 13 states have internal predecessors, (1964), 0 states have call successors, (0), 0 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-24 11:03:41,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 172.0) internal successors, (2408), 14 states have internal predecessors, (2408), 0 states have call successors, (0), 0 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-24 11:03:41,013 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 172.0) internal successors, (2408), 14 states have internal predecessors, (2408), 0 states have call successors, (0), 0 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-24 11:03:41,013 INFO L185 Difference]: Start difference. First operand has 103 places, 99 transitions, 860 flow. Second operand 13 states and 1964 transitions. [2021-03-24 11:03:41,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 107 transitions, 1006 flow [2021-03-24 11:03:41,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 853 flow, removed 64 selfloop flow, removed 9 redundant places. [2021-03-24 11:03:41,032 INFO L241 Difference]: Finished difference. Result has 111 places, 100 transitions, 811 flow [2021-03-24 11:03:41,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=811, PETRI_PLACES=111, PETRI_TRANSITIONS=100} [2021-03-24 11:03:41,033 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2021-03-24 11:03:41,033 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 100 transitions, 811 flow [2021-03-24 11:03:41,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 148.85714285714286) internal successors, (1042), 7 states have internal predecessors, (1042), 0 states have call successors, (0), 0 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-24 11:03:41,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:41,033 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:41,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-24 11:03:41,034 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1340717741, now seen corresponding path program 1 times [2021-03-24 11:03:41,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:41,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313827029] [2021-03-24 11:03:41,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:41,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:41,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:41,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:41,111 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-24 11:03:41,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313827029] [2021-03-24 11:03:41,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:41,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 11:03:41,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913705485] [2021-03-24 11:03:41,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:03:41,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:03:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:03:41,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 172 [2021-03-24 11:03:41,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-24 11:03:41,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:41,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 172 [2021-03-24 11:03:41,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:41,209 INFO L129 PetriNetUnfolder]: 378/1069 cut-off events. [2021-03-24 11:03:41,209 INFO L130 PetriNetUnfolder]: For 4752/4986 co-relation queries the response was YES. [2021-03-24 11:03:41,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4497 conditions, 1069 events. 378/1069 cut-off events. For 4752/4986 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 9009 event pairs, 6 based on Foata normal form. 46/1059 useless extension candidates. Maximal degree in co-relation 4467. Up to 266 conditions per place. [2021-03-24 11:03:41,216 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 4 selfloop transitions, 3 changer transitions 11/101 dead transitions. [2021-03-24 11:03:41,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 101 transitions, 833 flow [2021-03-24 11:03:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-24 11:03:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-24 11:03:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2021-03-24 11:03:41,217 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9069767441860465 [2021-03-24 11:03:41,217 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2021-03-24 11:03:41,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2021-03-24 11:03:41,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:41,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2021-03-24 11:03:41,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 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-24 11:03:41,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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-24 11:03:41,220 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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-24 11:03:41,220 INFO L185 Difference]: Start difference. First operand has 111 places, 100 transitions, 811 flow. Second operand 4 states and 624 transitions. [2021-03-24 11:03:41,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 101 transitions, 833 flow [2021-03-24 11:03:41,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 101 transitions, 758 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-03-24 11:03:41,260 INFO L241 Difference]: Finished difference. Result has 104 places, 90 transitions, 625 flow [2021-03-24 11:03:41,260 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=104, PETRI_TRANSITIONS=90} [2021-03-24 11:03:41,260 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 54 predicate places. [2021-03-24 11:03:41,260 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 625 flow [2021-03-24 11:03:41,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-24 11:03:41,261 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:41,261 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:41,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-24 11:03:41,261 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1496303231, now seen corresponding path program 2 times [2021-03-24 11:03:41,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:41,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66195447] [2021-03-24 11:03:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:41,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:41,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:41,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:41,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:03:41,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:03:41,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-24 11:03:41,372 INFO L142 QuantifierPusher]: treesize reduction 21, result has 82.9 percent of original size [2021-03-24 11:03:41,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2021-03-24 11:03:41,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 11:03:41,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:41,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:41,400 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-24 11:03:41,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66195447] [2021-03-24 11:03:41,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:41,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 11:03:41,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763663163] [2021-03-24 11:03:41,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 11:03:41,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 11:03:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-03-24 11:03:41,404 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 172 [2021-03-24 11:03:41,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 625 flow. Second operand has 10 states, 10 states have (on average 124.9) internal successors, (1249), 10 states have internal predecessors, (1249), 0 states have call successors, (0), 0 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-24 11:03:41,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:41,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 172 [2021-03-24 11:03:41,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:41,599 INFO L129 PetriNetUnfolder]: 365/1023 cut-off events. [2021-03-24 11:03:41,599 INFO L130 PetriNetUnfolder]: For 2776/2894 co-relation queries the response was YES. [2021-03-24 11:03:41,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3940 conditions, 1023 events. 365/1023 cut-off events. For 2776/2894 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 8620 event pairs, 5 based on Foata normal form. 51/1027 useless extension candidates. Maximal degree in co-relation 3911. Up to 266 conditions per place. [2021-03-24 11:03:41,605 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 24 selfloop transitions, 11 changer transitions 15/97 dead transitions. [2021-03-24 11:03:41,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 787 flow [2021-03-24 11:03:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 11:03:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 11:03:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1258 transitions. [2021-03-24 11:03:41,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7313953488372092 [2021-03-24 11:03:41,609 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1258 transitions. [2021-03-24 11:03:41,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1258 transitions. [2021-03-24 11:03:41,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:41,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1258 transitions. [2021-03-24 11:03:41,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.8) internal successors, (1258), 10 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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-24 11:03:41,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:41,615 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-24 11:03:41,615 INFO L185 Difference]: Start difference. First operand has 104 places, 90 transitions, 625 flow. Second operand 10 states and 1258 transitions. [2021-03-24 11:03:41,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 787 flow [2021-03-24 11:03:41,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 97 transitions, 761 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-03-24 11:03:41,645 INFO L241 Difference]: Finished difference. Result has 108 places, 81 transitions, 546 flow [2021-03-24 11:03:41,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=108, PETRI_TRANSITIONS=81} [2021-03-24 11:03:41,645 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 58 predicate places. [2021-03-24 11:03:41,645 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 81 transitions, 546 flow [2021-03-24 11:03:41,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 124.9) internal successors, (1249), 10 states have internal predecessors, (1249), 0 states have call successors, (0), 0 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-24 11:03:41,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:41,646 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:41,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-24 11:03:41,646 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1912437757, now seen corresponding path program 3 times [2021-03-24 11:03:41,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:41,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012734458] [2021-03-24 11:03:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:41,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:41,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:41,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:03:41,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 11:03:41,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:41,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 11:03:41,742 INFO L142 QuantifierPusher]: treesize reduction 17, result has 72.1 percent of original size [2021-03-24 11:03:41,743 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.5 percent of original size 35 [2021-03-24 11:03:41,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:03:41,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:41,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:41,771 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-24 11:03:41,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012734458] [2021-03-24 11:03:41,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:41,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 11:03:41,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950437190] [2021-03-24 11:03:41,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 11:03:41,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:41,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 11:03:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-24 11:03:41,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 172 [2021-03-24 11:03:41,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 81 transitions, 546 flow. Second operand has 9 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 0 states have call successors, (0), 0 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-24 11:03:41,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:41,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 172 [2021-03-24 11:03:41,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:41,913 INFO L129 PetriNetUnfolder]: 121/390 cut-off events. [2021-03-24 11:03:41,913 INFO L130 PetriNetUnfolder]: For 1038/1094 co-relation queries the response was YES. [2021-03-24 11:03:41,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 390 events. 121/390 cut-off events. For 1038/1094 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 2491 event pairs, 4 based on Foata normal form. 26/397 useless extension candidates. Maximal degree in co-relation 1486. Up to 84 conditions per place. [2021-03-24 11:03:41,915 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 19 selfloop transitions, 11 changer transitions 8/86 dead transitions. [2021-03-24 11:03:41,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 86 transitions, 672 flow [2021-03-24 11:03:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 11:03:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 11:03:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1171 transitions. [2021-03-24 11:03:41,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7564599483204134 [2021-03-24 11:03:41,917 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1171 transitions. [2021-03-24 11:03:41,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1171 transitions. [2021-03-24 11:03:41,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:41,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1171 transitions. [2021-03-24 11:03:41,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.11111111111111) internal successors, (1171), 9 states have internal predecessors, (1171), 0 states have call successors, (0), 0 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-24 11:03:41,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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-24 11:03:41,922 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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-24 11:03:41,922 INFO L185 Difference]: Start difference. First operand has 108 places, 81 transitions, 546 flow. Second operand 9 states and 1171 transitions. [2021-03-24 11:03:41,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 86 transitions, 672 flow [2021-03-24 11:03:41,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 86 transitions, 583 flow, removed 14 selfloop flow, removed 17 redundant places. [2021-03-24 11:03:41,928 INFO L241 Difference]: Finished difference. Result has 98 places, 77 transitions, 470 flow [2021-03-24 11:03:41,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=98, PETRI_TRANSITIONS=77} [2021-03-24 11:03:41,929 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2021-03-24 11:03:41,929 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 77 transitions, 470 flow [2021-03-24 11:03:41,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 129.0) internal successors, (1161), 9 states have internal predecessors, (1161), 0 states have call successors, (0), 0 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-24 11:03:41,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:41,929 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:41,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-24 11:03:41,929 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash -448702009, now seen corresponding path program 4 times [2021-03-24 11:03:41,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:41,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563732097] [2021-03-24 11:03:41,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:03:42,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:03:42,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-24 11:03:42,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:42,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-24 11:03:42,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-24 11:03:42,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 11:03:42,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 11:03:42,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-24 11:03:42,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-24 11:03:42,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-24 11:03:42,078 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-24 11:03:42,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 11:03:42,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-24 11:03:42,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 11:03:42,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:03:42,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:03:42,120 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-24 11:03:42,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563732097] [2021-03-24 11:03:42,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:03:42,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-24 11:03:42,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110895103] [2021-03-24 11:03:42,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-24 11:03:42,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:03:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-24 11:03:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-03-24 11:03:42,122 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 172 [2021-03-24 11:03:42,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 77 transitions, 470 flow. Second operand has 13 states, 13 states have (on average 107.53846153846153) internal successors, (1398), 13 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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-24 11:03:42,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:03:42,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 172 [2021-03-24 11:03:42,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:03:42,338 INFO L129 PetriNetUnfolder]: 109/355 cut-off events. [2021-03-24 11:03:42,339 INFO L130 PetriNetUnfolder]: For 868/911 co-relation queries the response was YES. [2021-03-24 11:03:42,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 355 events. 109/355 cut-off events. For 868/911 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2212 event pairs, 3 based on Foata normal form. 27/363 useless extension candidates. Maximal degree in co-relation 1304. Up to 77 conditions per place. [2021-03-24 11:03:42,341 INFO L132 encePairwiseOnDemand]: 161/172 looper letters, 14 selfloop transitions, 13 changer transitions 11/84 dead transitions. [2021-03-24 11:03:42,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 84 transitions, 596 flow [2021-03-24 11:03:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 11:03:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 11:03:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1410 transitions. [2021-03-24 11:03:42,342 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6305903398926654 [2021-03-24 11:03:42,342 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1410 transitions. [2021-03-24 11:03:42,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1410 transitions. [2021-03-24 11:03:42,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:03:42,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1410 transitions. [2021-03-24 11:03:42,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.46153846153847) internal successors, (1410), 13 states have internal predecessors, (1410), 0 states have call successors, (0), 0 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-24 11:03:42,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 172.0) internal successors, (2408), 14 states have internal predecessors, (2408), 0 states have call successors, (0), 0 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-24 11:03:42,346 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 172.0) internal successors, (2408), 14 states have internal predecessors, (2408), 0 states have call successors, (0), 0 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-24 11:03:42,346 INFO L185 Difference]: Start difference. First operand has 98 places, 77 transitions, 470 flow. Second operand 13 states and 1410 transitions. [2021-03-24 11:03:42,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 84 transitions, 596 flow [2021-03-24 11:03:42,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 84 transitions, 564 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-24 11:03:42,352 INFO L241 Difference]: Finished difference. Result has 102 places, 72 transitions, 429 flow [2021-03-24 11:03:42,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=429, PETRI_PLACES=102, PETRI_TRANSITIONS=72} [2021-03-24 11:03:42,352 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2021-03-24 11:03:42,352 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 72 transitions, 429 flow [2021-03-24 11:03:42,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 107.53846153846153) internal successors, (1398), 13 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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-24 11:03:42,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:03:42,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:03:42,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-24 11:03:42,353 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:03:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:03:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1493307561, now seen corresponding path program 5 times [2021-03-24 11:03:42,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:03:42,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471416243] [2021-03-24 11:03:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:03:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 11:03:42,436 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 11:03:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 11:03:42,493 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 11:03:42,528 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 11:03:42,528 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 11:03:42,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-24 11:03:42,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 11:03:42 BasicIcfg [2021-03-24 11:03:42,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 11:03:42,635 INFO L168 Benchmark]: Toolchain (without parser) took 17957.54 ms. Allocated memory was 377.5 MB in the beginning and 1.0 GB in the end (delta: 650.1 MB). Free memory was 340.3 MB in the beginning and 931.3 MB in the end (delta: -591.0 MB). Peak memory consumption was 61.1 MB. Max. memory is 16.0 GB. [2021-03-24 11:03:42,635 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 377.5 MB. Free memory is still 358.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 11:03:42,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 537.68 ms. Allocated memory is still 377.5 MB. Free memory was 340.2 MB in the beginning and 334.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.0 GB. [2021-03-24 11:03:42,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.10 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 331.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 11:03:42,636 INFO L168 Benchmark]: Boogie Preprocessor took 49.81 ms. Allocated memory is still 377.5 MB. Free memory was 331.0 MB in the beginning and 327.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-24 11:03:42,636 INFO L168 Benchmark]: RCFGBuilder took 2318.48 ms. Allocated memory was 377.5 MB in the beginning and 507.5 MB in the end (delta: 130.0 MB). Free memory was 327.8 MB in the beginning and 353.1 MB in the end (delta: -25.2 MB). Peak memory consumption was 173.0 MB. Max. memory is 16.0 GB. [2021-03-24 11:03:42,636 INFO L168 Benchmark]: TraceAbstraction took 14977.49 ms. Allocated memory was 507.5 MB in the beginning and 1.0 GB in the end (delta: 520.1 MB). Free memory was 353.1 MB in the beginning and 931.3 MB in the end (delta: -578.3 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 11:03:42,640 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.09 ms. Allocated memory is still 377.5 MB. Free memory is still 358.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 537.68 ms. Allocated memory is still 377.5 MB. Free memory was 340.2 MB in the beginning and 334.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 70.10 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 331.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.81 ms. Allocated memory is still 377.5 MB. Free memory was 331.0 MB in the beginning and 327.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2318.48 ms. Allocated memory was 377.5 MB in the beginning and 507.5 MB in the end (delta: 130.0 MB). Free memory was 327.8 MB in the beginning and 353.1 MB in the end (delta: -25.2 MB). Peak memory consumption was 173.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14977.49 ms. Allocated memory was 507.5 MB in the beginning and 1.0 GB in the end (delta: 520.1 MB). Free memory was 353.1 MB in the beginning and 931.3 MB in the end (delta: -578.3 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: 8363.1ms, 107 PlacesBefore, 50 PlacesAfterwards, 98 TransitionsBefore, 41 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 4 FixpointIterations, 36 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 59 TotalNumberOfCompositions, 1744 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 696, positive: 636, positive conditional: 0, positive unconditional: 636, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 443, positive: 425, positive conditional: 0, positive unconditional: 425, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 443, positive: 425, positive conditional: 0, positive unconditional: 425, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 696, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 443, unknown conditional: 0, unknown unconditional: 443] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0] [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0] [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0] [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0] [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0] [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0] [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={7:0}] [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0] [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2136; [L853] FCALL, FORK 0 pthread_create(&t2136, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t2137; [L855] FCALL, FORK 0 pthread_create(&t2137, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] 0 pthread_t t2138; [L857] FCALL, FORK 0 pthread_create(&t2138, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L814] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1) [L815] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used) [L816] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3) [L818] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L819] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] EXPR 3 \read(x) [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L875] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L877] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L879] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$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=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice1=255, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14772.8ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3574.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8414.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 164 SDtfs, 236 SDslu, 273 SDs, 0 SdLazy, 1091 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1009.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1073.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=13, InterpolantAutomatonStates: 148, 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: 62.9ms SsaConstructionTime, 878.1ms SatisfiabilityAnalysisTime, 1533.0ms InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 4161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...