/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:03:13,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:03:13,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:03:13,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:03:13,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:03:13,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:03:13,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:03:13,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:03:13,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:03:13,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:03:13,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:03:13,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:03:13,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:03:13,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:03:13,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:03:13,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:03:13,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:03:13,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:03:13,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:03:13,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:03:13,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:03:13,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:03:13,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:03:13,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:03:13,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:03:13,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:03:13,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:03:13,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:03:13,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:03:13,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:03:13,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:03:13,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:03:13,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:03:13,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:03:13,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:03:13,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:03:13,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:03:13,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:03:13,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:03:13,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:03:13,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:03:13,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 05:03:13,785 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:03:13,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:03:13,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:03:13,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:03:13,789 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:03:13,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:03:13,789 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:03:13,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:03:13,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:03:13,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:03:13,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:03:13,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:03:13,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:03:13,791 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:03:13,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:03:13,791 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:03:13,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:03:13,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:03:13,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:03:13,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:03:13,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:03:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:03:13,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:03:13,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:03:13,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:03:13,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:03:13,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:03:13,793 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:03:13,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:03:13,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:03:13,793 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 05:03:14,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:03:14,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:03:14,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:03:14,152 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:03:14,153 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:03:14,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2021-03-25 05:03:14,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb7bf015/677587db110646d5a7c8eaf0572b2194/FLAGde53ae91b [2021-03-25 05:03:14,800 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:03:14,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2021-03-25 05:03:14,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb7bf015/677587db110646d5a7c8eaf0572b2194/FLAGde53ae91b [2021-03-25 05:03:15,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbb7bf015/677587db110646d5a7c8eaf0572b2194 [2021-03-25 05:03:15,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:03:15,071 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:03:15,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:03:15,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:03:15,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:03:15,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b83a7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15, skipping insertion in model container [2021-03-25 05:03:15,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:03:15,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:03:15,325 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/safe016_power.oepc.i[995,1008] [2021-03-25 05:03:15,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:03:15,566 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:03:15,576 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/safe016_power.oepc.i[995,1008] [2021-03-25 05:03:15,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:03:15,690 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:03:15,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15 WrapperNode [2021-03-25 05:03:15,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:03:15,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:03:15,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:03:15,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:03:15,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:03:15,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:03:15,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:03:15,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:03:15,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... [2021-03-25 05:03:15,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:03:15,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:03:15,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:03:15,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:03:15,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:03:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 05:03:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:03:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:03:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:03:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:03:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:03:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:03:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:03:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:03:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 05:03:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 05:03:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 05:03:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 05:03:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:03:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:03:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:03:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:03:15,884 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 05:03:18,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:03:18,821 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 05:03:18,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:03:18 BoogieIcfgContainer [2021-03-25 05:03:18,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:03:18,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:03:18,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:03:18,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:03:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:03:15" (1/3) ... [2021-03-25 05:03:18,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f8c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:03:18, skipping insertion in model container [2021-03-25 05:03:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:03:15" (2/3) ... [2021-03-25 05:03:18,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125f8c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:03:18, skipping insertion in model container [2021-03-25 05:03:18,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:03:18" (3/3) ... [2021-03-25 05:03:18,829 INFO L111 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2021-03-25 05:03:18,834 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:03:18,838 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 05:03:18,839 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:03:18,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,891 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,909 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,915 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,958 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,958 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,960 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:03:18,965 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:03:18,980 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 05:03:19,004 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:03:19,005 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:03:19,005 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:03:19,005 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:03:19,005 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:03:19,005 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:03:19,005 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:03:19,005 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:03:19,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2021-03-25 05:03:19,069 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2021-03-25 05:03:19,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:03:19,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-03-25 05:03:19,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2021-03-25 05:03:19,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 110 transitions, 232 flow [2021-03-25 05:03:19,080 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:19,087 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-25 05:03:19,089 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-25 05:03:19,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 110 transitions, 232 flow [2021-03-25 05:03:19,129 INFO L129 PetriNetUnfolder]: 1/110 cut-off events. [2021-03-25 05:03:19,129 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:03:19,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-03-25 05:03:19,134 INFO L142 LiptonReduction]: Number of co-enabled transitions 1430 [2021-03-25 05:03:20,278 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 298 DAG size of output: 258 [2021-03-25 05:03:20,770 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 05:03:22,799 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 394 DAG size of output: 350 [2021-03-25 05:03:23,686 WARN L205 SmtUtils]: Spent 883.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2021-03-25 05:03:26,420 WARN L205 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-25 05:03:28,115 WARN L205 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 361 DAG size of output: 361 [2021-03-25 05:03:31,911 WARN L205 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-25 05:03:33,773 WARN L205 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-25 05:03:34,581 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 05:03:35,050 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-25 05:03:35,198 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 05:03:36,626 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 05:03:37,168 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 05:03:38,198 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 349 [2021-03-25 05:03:39,220 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 349 [2021-03-25 05:03:40,552 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 259 DAG size of output: 244 [2021-03-25 05:03:41,078 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-03-25 05:03:43,113 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 350 DAG size of output: 335 [2021-03-25 05:03:44,198 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 329 [2021-03-25 05:03:44,210 INFO L154 LiptonReduction]: Checked pairs total: 1852 [2021-03-25 05:03:44,211 INFO L156 LiptonReduction]: Total number of compositions: 69 [2021-03-25 05:03:44,213 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25134 [2021-03-25 05:03:44,223 INFO L129 PetriNetUnfolder]: 1/43 cut-off events. [2021-03-25 05:03:44,224 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:03:44,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:44,225 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:44,225 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -310150407, now seen corresponding path program 1 times [2021-03-25 05:03:44,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:44,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365629343] [2021-03-25 05:03:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:44,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:44,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:44,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:44,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:44,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365629343] [2021-03-25 05:03:44,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:44,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:03:44,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398390988] [2021-03-25 05:03:44,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:03:44,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:03:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:03:44,633 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 197 [2021-03-25 05:03:44,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:44,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:44,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 197 [2021-03-25 05:03:44,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:44,691 INFO L129 PetriNetUnfolder]: 12/69 cut-off events. [2021-03-25 05:03:44,691 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:03:44,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 69 events. 12/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 2 based on Foata normal form. 4/66 useless extension candidates. Maximal degree in co-relation 80. Up to 25 conditions per place. [2021-03-25 05:03:44,693 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 5 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2021-03-25 05:03:44,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 118 flow [2021-03-25 05:03:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:03:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:03:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2021-03-25 05:03:44,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9272419627749577 [2021-03-25 05:03:44,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2021-03-25 05:03:44,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2021-03-25 05:03:44,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:44,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2021-03-25 05:03:44,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:44,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:44,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:44,727 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 548 transitions. [2021-03-25 05:03:44,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 118 flow [2021-03-25 05:03:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 05:03:44,731 INFO L241 Difference]: Finished difference. Result has 54 places, 44 transitions, 111 flow [2021-03-25 05:03:44,732 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2021-03-25 05:03:44,733 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2021-03-25 05:03:44,733 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:44,733 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 44 transitions, 111 flow [2021-03-25 05:03:44,734 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 111 flow [2021-03-25 05:03:44,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 111 flow [2021-03-25 05:03:44,755 INFO L129 PetriNetUnfolder]: 3/50 cut-off events. [2021-03-25 05:03:44,756 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 05:03:44,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 50 events. 3/50 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 05:03:44,756 INFO L142 LiptonReduction]: Number of co-enabled transitions 320 [2021-03-25 05:03:44,867 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-03-25 05:03:45,934 INFO L154 LiptonReduction]: Checked pairs total: 759 [2021-03-25 05:03:45,934 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 05:03:45,935 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1202 [2021-03-25 05:03:45,935 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2021-03-25 05:03:45,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:45,936 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:45,936 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-25 05:03:45,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:03:45,936 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash -215139068, now seen corresponding path program 1 times [2021-03-25 05:03:45,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:45,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419475502] [2021-03-25 05:03:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:46,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:46,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:46,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:46,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:46,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:46,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:03:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:46,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419475502] [2021-03-25 05:03:46,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:46,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:03:46,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805721677] [2021-03-25 05:03:46,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:03:46,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:46,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:03:46,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:03:46,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 210 [2021-03-25 05:03:46,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:46,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:46,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 210 [2021-03-25 05:03:46,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:46,123 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-25 05:03:46,123 INFO L130 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2021-03-25 05:03:46,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 37 events. 3/37 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 1 based on Foata normal form. 1/35 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2021-03-25 05:03:46,124 INFO L132 encePairwiseOnDemand]: 206/210 looper letters, 1 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-25 05:03:46,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 93 flow [2021-03-25 05:03:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:03:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:03:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 773 transitions. [2021-03-25 05:03:46,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202380952380952 [2021-03-25 05:03:46,128 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 773 transitions. [2021-03-25 05:03:46,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 773 transitions. [2021-03-25 05:03:46,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:46,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 773 transitions. [2021-03-25 05:03:46,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:46,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:46,134 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:46,134 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 4 states and 773 transitions. [2021-03-25 05:03:46,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 93 flow [2021-03-25 05:03:46,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:03:46,135 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 92 flow [2021-03-25 05:03:46,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-25 05:03:46,136 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -12 predicate places. [2021-03-25 05:03:46,136 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:46,137 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 92 flow [2021-03-25 05:03:46,137 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 92 flow [2021-03-25 05:03:46,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 92 flow [2021-03-25 05:03:46,144 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-25 05:03:46,144 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 05:03:46,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 37 events. 3/37 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 05:03:46,145 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 05:03:46,349 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-03-25 05:03:46,773 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 05:03:46,901 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 05:03:47,026 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 05:03:47,143 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 05:03:47,250 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 05:03:47,377 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-25 05:03:47,484 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 05:03:47,587 INFO L154 LiptonReduction]: Checked pairs total: 756 [2021-03-25 05:03:47,587 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 05:03:47,587 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1451 [2021-03-25 05:03:47,588 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 82 flow [2021-03-25 05:03:47,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:47,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:47,588 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:47,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:03:47,589 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:47,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1368661259, now seen corresponding path program 1 times [2021-03-25 05:03:47,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:47,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206916866] [2021-03-25 05:03:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:47,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:47,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:47,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:47,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:47,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206916866] [2021-03-25 05:03:47,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:47,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:03:47,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453101088] [2021-03-25 05:03:47,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:03:47,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:47,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:03:47,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:03:47,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 214 [2021-03-25 05:03:47,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:47,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:47,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 214 [2021-03-25 05:03:47,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:47,675 INFO L129 PetriNetUnfolder]: 7/51 cut-off events. [2021-03-25 05:03:47,676 INFO L130 PetriNetUnfolder]: For 31/103 co-relation queries the response was YES. [2021-03-25 05:03:47,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 51 events. 7/51 cut-off events. For 31/103 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 160 event pairs, 4 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 96. Up to 15 conditions per place. [2021-03-25 05:03:47,676 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 5 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 05:03:47,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 28 transitions, 100 flow [2021-03-25 05:03:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:03:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:03:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2021-03-25 05:03:47,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9143302180685359 [2021-03-25 05:03:47,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2021-03-25 05:03:47,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2021-03-25 05:03:47,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:47,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2021-03-25 05:03:47,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:47,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:47,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:47,684 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 82 flow. Second operand 3 states and 587 transitions. [2021-03-25 05:03:47,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 28 transitions, 100 flow [2021-03-25 05:03:47,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:03:47,685 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 89 flow [2021-03-25 05:03:47,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2021-03-25 05:03:47,686 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -16 predicate places. [2021-03-25 05:03:47,686 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:47,686 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 89 flow [2021-03-25 05:03:47,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 89 flow [2021-03-25 05:03:47,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 89 flow [2021-03-25 05:03:47,692 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 05:03:47,692 INFO L130 PetriNetUnfolder]: For 14/20 co-relation queries the response was YES. [2021-03-25 05:03:47,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 32 events. 0/32 cut-off events. For 14/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-03-25 05:03:47,693 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 05:03:48,465 WARN L205 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2021-03-25 05:03:48,808 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-25 05:03:49,569 WARN L205 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2021-03-25 05:03:49,914 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-25 05:03:49,917 INFO L154 LiptonReduction]: Checked pairs total: 580 [2021-03-25 05:03:49,918 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:03:49,918 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2232 [2021-03-25 05:03:49,918 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 87 flow [2021-03-25 05:03:49,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:49,919 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:49,919 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:49,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:03:49,919 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2055631850, now seen corresponding path program 1 times [2021-03-25 05:03:49,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:49,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251706538] [2021-03-25 05:03:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:50,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:50,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251706538] [2021-03-25 05:03:50,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:50,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 05:03:50,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127926677] [2021-03-25 05:03:50,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:03:50,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:03:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:03:50,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 215 [2021-03-25 05:03:50,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:50,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 215 [2021-03-25 05:03:50,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:50,113 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-25 05:03:50,113 INFO L130 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2021-03-25 05:03:50,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 31 events. 0/31 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-03-25 05:03:50,114 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 1 selfloop transitions, 2 changer transitions 1/26 dead transitions. [2021-03-25 05:03:50,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 93 flow [2021-03-25 05:03:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:03:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:03:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2021-03-25 05:03:50,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9224806201550387 [2021-03-25 05:03:50,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2021-03-25 05:03:50,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2021-03-25 05:03:50,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:50,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2021-03-25 05:03:50,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-25 05:03:50,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-25 05:03:50,122 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 87 flow. Second operand 3 states and 595 transitions. [2021-03-25 05:03:50,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 93 flow [2021-03-25 05:03:50,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 26 transitions, 88 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 05:03:50,125 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 88 flow [2021-03-25 05:03:50,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2021-03-25 05:03:50,125 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2021-03-25 05:03:50,125 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:50,125 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 88 flow [2021-03-25 05:03:50,126 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 88 flow [2021-03-25 05:03:50,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 88 flow [2021-03-25 05:03:50,132 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 05:03:50,132 INFO L130 PetriNetUnfolder]: For 14/18 co-relation queries the response was YES. [2021-03-25 05:03:50,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 30 events. 0/30 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-03-25 05:03:50,135 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-25 05:03:50,137 INFO L154 LiptonReduction]: Checked pairs total: 260 [2021-03-25 05:03:50,137 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:03:50,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 05:03:50,138 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 88 flow [2021-03-25 05:03:50,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:50,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:50,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:03:50,140 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1650841637, now seen corresponding path program 1 times [2021-03-25 05:03:50,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:50,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069197482] [2021-03-25 05:03:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:50,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 05:03:50,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 05:03:50,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 05:03:50,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:03:50,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 05:03:50,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:03:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:50,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069197482] [2021-03-25 05:03:50,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:50,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:03:50,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091195929] [2021-03-25 05:03:50,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:03:50,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:03:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:03:50,451 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 215 [2021-03-25 05:03:50,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:50,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 215 [2021-03-25 05:03:50,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:50,555 INFO L129 PetriNetUnfolder]: 78/203 cut-off events. [2021-03-25 05:03:50,556 INFO L130 PetriNetUnfolder]: For 121/153 co-relation queries the response was YES. [2021-03-25 05:03:50,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 203 events. 78/203 cut-off events. For 121/153 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 863 event pairs, 40 based on Foata normal form. 2/191 useless extension candidates. Maximal degree in co-relation 474. Up to 127 conditions per place. [2021-03-25 05:03:50,558 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 13 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 05:03:50,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 131 flow [2021-03-25 05:03:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:03:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:03:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-25 05:03:50,561 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7007751937984497 [2021-03-25 05:03:50,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-25 05:03:50,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-25 05:03:50,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:50,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-25 05:03:50,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-25 05:03:50,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 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-25 05:03:50,565 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 88 flow. Second operand 3 states and 452 transitions. [2021-03-25 05:03:50,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 131 flow [2021-03-25 05:03:50,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:03:50,566 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 103 flow [2021-03-25 05:03:50,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2021-03-25 05:03:50,567 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2021-03-25 05:03:50,567 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:50,567 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 103 flow [2021-03-25 05:03:50,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 103 flow [2021-03-25 05:03:50,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 103 flow [2021-03-25 05:03:50,576 INFO L129 PetriNetUnfolder]: 5/48 cut-off events. [2021-03-25 05:03:50,576 INFO L130 PetriNetUnfolder]: For 62/74 co-relation queries the response was YES. [2021-03-25 05:03:50,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 48 events. 5/48 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 104. Up to 15 conditions per place. [2021-03-25 05:03:50,577 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 05:03:50,578 INFO L154 LiptonReduction]: Checked pairs total: 245 [2021-03-25 05:03:50,579 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:03:50,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 05:03:50,579 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 103 flow [2021-03-25 05:03:50,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:50,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:50,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:03:50,580 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -820438030, now seen corresponding path program 1 times [2021-03-25 05:03:50,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:50,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089603852] [2021-03-25 05:03:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:50,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:03:50,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:03:50,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:03:50,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:50,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:03:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:50,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089603852] [2021-03-25 05:03:50,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:50,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:03:50,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187971675] [2021-03-25 05:03:50,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:03:50,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:03:50,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:03:50,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 215 [2021-03-25 05:03:50,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 157.33333333333334) internal successors, (944), 6 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:50,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 215 [2021-03-25 05:03:50,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:50,918 INFO L129 PetriNetUnfolder]: 100/274 cut-off events. [2021-03-25 05:03:50,919 INFO L130 PetriNetUnfolder]: For 314/352 co-relation queries the response was YES. [2021-03-25 05:03:50,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 274 events. 100/274 cut-off events. For 314/352 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1377 event pairs, 35 based on Foata normal form. 3/264 useless extension candidates. Maximal degree in co-relation 678. Up to 147 conditions per place. [2021-03-25 05:03:50,922 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2021-03-25 05:03:50,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 156 flow [2021-03-25 05:03:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:03:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:03:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-25 05:03:50,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7465116279069768 [2021-03-25 05:03:50,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-25 05:03:50,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-25 05:03:50,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:50,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-25 05:03:50,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 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-25 05:03:50,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 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-25 05:03:50,929 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 103 flow. Second operand 4 states and 642 transitions. [2021-03-25 05:03:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 156 flow [2021-03-25 05:03:50,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:03:50,934 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 140 flow [2021-03-25 05:03:50,934 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-25 05:03:50,935 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -12 predicate places. [2021-03-25 05:03:50,935 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:50,935 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 140 flow [2021-03-25 05:03:50,935 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 140 flow [2021-03-25 05:03:50,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 140 flow [2021-03-25 05:03:50,953 INFO L129 PetriNetUnfolder]: 30/110 cut-off events. [2021-03-25 05:03:50,953 INFO L130 PetriNetUnfolder]: For 257/293 co-relation queries the response was YES. [2021-03-25 05:03:50,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 110 events. 30/110 cut-off events. For 257/293 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 466 event pairs, 12 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 306. Up to 56 conditions per place. [2021-03-25 05:03:50,956 INFO L142 LiptonReduction]: Number of co-enabled transitions 376 [2021-03-25 05:03:50,958 INFO L154 LiptonReduction]: Checked pairs total: 184 [2021-03-25 05:03:50,958 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:03:50,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 05:03:50,962 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 140 flow [2021-03-25 05:03:50,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.33333333333334) internal successors, (944), 6 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:50,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:50,963 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:50,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:03:50,963 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1844334601, now seen corresponding path program 1 times [2021-03-25 05:03:50,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:50,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89875403] [2021-03-25 05:03:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:51,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:51,092 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:03:51,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:03:51,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:51,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89875403] [2021-03-25 05:03:51,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:51,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:03:51,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533984655] [2021-03-25 05:03:51,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:03:51,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:51,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:03:51,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:03:51,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-25 05:03:51,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:51,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-25 05:03:51,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:51,270 INFO L129 PetriNetUnfolder]: 397/743 cut-off events. [2021-03-25 05:03:51,270 INFO L130 PetriNetUnfolder]: For 1241/1379 co-relation queries the response was YES. [2021-03-25 05:03:51,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 743 events. 397/743 cut-off events. For 1241/1379 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 4746 event pairs, 196 based on Foata normal form. 56/659 useless extension candidates. Maximal degree in co-relation 1929. Up to 430 conditions per place. [2021-03-25 05:03:51,277 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 9 selfloop transitions, 9 changer transitions 2/44 dead transitions. [2021-03-25 05:03:51,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 206 flow [2021-03-25 05:03:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:03:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:03:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 952 transitions. [2021-03-25 05:03:51,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8855813953488372 [2021-03-25 05:03:51,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 952 transitions. [2021-03-25 05:03:51,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 952 transitions. [2021-03-25 05:03:51,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:51,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 952 transitions. [2021-03-25 05:03:51,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,285 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 140 flow. Second operand 5 states and 952 transitions. [2021-03-25 05:03:51,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 206 flow [2021-03-25 05:03:51,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 196 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 05:03:51,289 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 199 flow [2021-03-25 05:03:51,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-25 05:03:51,289 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2021-03-25 05:03:51,289 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:51,289 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 199 flow [2021-03-25 05:03:51,289 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 199 flow [2021-03-25 05:03:51,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 199 flow [2021-03-25 05:03:51,378 INFO L129 PetriNetUnfolder]: 435/811 cut-off events. [2021-03-25 05:03:51,378 INFO L130 PetriNetUnfolder]: For 1576/1804 co-relation queries the response was YES. [2021-03-25 05:03:51,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 811 events. 435/811 cut-off events. For 1576/1804 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 5394 event pairs, 217 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 2585. Up to 533 conditions per place. [2021-03-25 05:03:51,391 INFO L142 LiptonReduction]: Number of co-enabled transitions 544 [2021-03-25 05:03:51,411 INFO L154 LiptonReduction]: Checked pairs total: 113 [2021-03-25 05:03:51,411 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:03:51,411 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-03-25 05:03:51,411 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 193 flow [2021-03-25 05:03:51,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,412 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:51,412 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:51,412 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:03:51,413 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:51,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash 49579643, now seen corresponding path program 1 times [2021-03-25 05:03:51,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:51,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073490795] [2021-03-25 05:03:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:51,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:51,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:51,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073490795] [2021-03-25 05:03:51,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:51,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:03:51,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680774871] [2021-03-25 05:03:51,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:03:51,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:51,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:03:51,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:03:51,479 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2021-03-25 05:03:51,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:51,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2021-03-25 05:03:51,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:51,632 INFO L129 PetriNetUnfolder]: 671/1232 cut-off events. [2021-03-25 05:03:51,632 INFO L130 PetriNetUnfolder]: For 4191/4817 co-relation queries the response was YES. [2021-03-25 05:03:51,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3840 conditions, 1232 events. 671/1232 cut-off events. For 4191/4817 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 8316 event pairs, 336 based on Foata normal form. 50/1082 useless extension candidates. Maximal degree in co-relation 3820. Up to 806 conditions per place. [2021-03-25 05:03:51,642 INFO L132 encePairwiseOnDemand]: 210/215 looper letters, 5 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2021-03-25 05:03:51,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 208 flow [2021-03-25 05:03:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:03:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:03:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2021-03-25 05:03:51,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825581395348837 [2021-03-25 05:03:51,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2021-03-25 05:03:51,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2021-03-25 05:03:51,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:51,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2021-03-25 05:03:51,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 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-25 05:03:51,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 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-25 05:03:51,650 INFO L185 Difference]: Start difference. First operand has 49 places, 38 transitions, 193 flow. Second operand 4 states and 759 transitions. [2021-03-25 05:03:51,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 208 flow [2021-03-25 05:03:51,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 05:03:51,658 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 181 flow [2021-03-25 05:03:51,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-25 05:03:51,658 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2021-03-25 05:03:51,658 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:51,658 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 181 flow [2021-03-25 05:03:51,659 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 181 flow [2021-03-25 05:03:51,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 35 transitions, 181 flow [2021-03-25 05:03:51,736 INFO L129 PetriNetUnfolder]: 394/736 cut-off events. [2021-03-25 05:03:51,736 INFO L130 PetriNetUnfolder]: For 1830/1984 co-relation queries the response was YES. [2021-03-25 05:03:51,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 736 events. 394/736 cut-off events. For 1830/1984 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4685 event pairs, 203 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 2333. Up to 447 conditions per place. [2021-03-25 05:03:51,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-25 05:03:51,753 INFO L154 LiptonReduction]: Checked pairs total: 41 [2021-03-25 05:03:51,753 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:03:51,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-25 05:03:51,753 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 181 flow [2021-03-25 05:03:51,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:51,754 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:51,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 05:03:51,754 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -912327609, now seen corresponding path program 2 times [2021-03-25 05:03:51,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:51,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369773507] [2021-03-25 05:03:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:51,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:51,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:51,838 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:03:51,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:03:51,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:51,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:51,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369773507] [2021-03-25 05:03:51,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:51,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:03:51,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423344051] [2021-03-25 05:03:51,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:03:51,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:03:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:03:51,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-25 05:03:51,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:51,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-25 05:03:51,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:51,958 INFO L129 PetriNetUnfolder]: 246/523 cut-off events. [2021-03-25 05:03:51,958 INFO L130 PetriNetUnfolder]: For 1198/1754 co-relation queries the response was YES. [2021-03-25 05:03:51,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 523 events. 246/523 cut-off events. For 1198/1754 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3124 event pairs, 56 based on Foata normal form. 92/555 useless extension candidates. Maximal degree in co-relation 1981. Up to 350 conditions per place. [2021-03-25 05:03:51,963 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 9 selfloop transitions, 13 changer transitions 2/48 dead transitions. [2021-03-25 05:03:51,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 305 flow [2021-03-25 05:03:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:03:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:03:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1142 transitions. [2021-03-25 05:03:51,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8852713178294573 [2021-03-25 05:03:51,967 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1142 transitions. [2021-03-25 05:03:51,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1142 transitions. [2021-03-25 05:03:51,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:51,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1142 transitions. [2021-03-25 05:03:51,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:51,972 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 181 flow. Second operand 6 states and 1142 transitions. [2021-03-25 05:03:51,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 305 flow [2021-03-25 05:03:51,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 295 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 05:03:51,976 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 281 flow [2021-03-25 05:03:51,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-25 05:03:51,976 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2021-03-25 05:03:51,977 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:51,977 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 281 flow [2021-03-25 05:03:51,977 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 281 flow [2021-03-25 05:03:51,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 281 flow [2021-03-25 05:03:52,034 INFO L129 PetriNetUnfolder]: 263/569 cut-off events. [2021-03-25 05:03:52,035 INFO L130 PetriNetUnfolder]: For 1840/2337 co-relation queries the response was YES. [2021-03-25 05:03:52,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 569 events. 263/569 cut-off events. For 1840/2337 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 3729 event pairs, 59 based on Foata normal form. 3/515 useless extension candidates. Maximal degree in co-relation 2481. Up to 391 conditions per place. [2021-03-25 05:03:52,042 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-25 05:03:52,087 INFO L154 LiptonReduction]: Checked pairs total: 121 [2021-03-25 05:03:52,087 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:03:52,087 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-03-25 05:03:52,087 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 273 flow [2021-03-25 05:03:52,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,088 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:52,088 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:52,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 05:03:52,089 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -33189084, now seen corresponding path program 1 times [2021-03-25 05:03:52,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:52,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638068883] [2021-03-25 05:03:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:52,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:52,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:52,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:52,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638068883] [2021-03-25 05:03:52,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:52,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:03:52,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715305856] [2021-03-25 05:03:52,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:03:52,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:52,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:03:52,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:03:52,157 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2021-03-25 05:03:52,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 188.25) internal successors, (753), 4 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:52,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2021-03-25 05:03:52,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:52,258 INFO L129 PetriNetUnfolder]: 346/707 cut-off events. [2021-03-25 05:03:52,258 INFO L130 PetriNetUnfolder]: For 3026/3871 co-relation queries the response was YES. [2021-03-25 05:03:52,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3049 conditions, 707 events. 346/707 cut-off events. For 3026/3871 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4353 event pairs, 93 based on Foata normal form. 41/672 useless extension candidates. Maximal degree in co-relation 3026. Up to 453 conditions per place. [2021-03-25 05:03:52,264 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 4 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2021-03-25 05:03:52,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 269 flow [2021-03-25 05:03:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:03:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:03:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 944 transitions. [2021-03-25 05:03:52,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.878139534883721 [2021-03-25 05:03:52,268 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 944 transitions. [2021-03-25 05:03:52,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 944 transitions. [2021-03-25 05:03:52,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:52,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 944 transitions. [2021-03-25 05:03:52,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.8) internal successors, (944), 5 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,273 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,273 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 273 flow. Second operand 5 states and 944 transitions. [2021-03-25 05:03:52,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 269 flow [2021-03-25 05:03:52,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 231 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 05:03:52,281 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 232 flow [2021-03-25 05:03:52,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-25 05:03:52,282 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2021-03-25 05:03:52,282 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:52,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 41 transitions, 232 flow [2021-03-25 05:03:52,282 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 41 transitions, 232 flow [2021-03-25 05:03:52,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 232 flow [2021-03-25 05:03:52,375 INFO L129 PetriNetUnfolder]: 385/789 cut-off events. [2021-03-25 05:03:52,376 INFO L130 PetriNetUnfolder]: For 1782/1987 co-relation queries the response was YES. [2021-03-25 05:03:52,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 789 events. 385/789 cut-off events. For 1782/1987 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5165 event pairs, 101 based on Foata normal form. 14/730 useless extension candidates. Maximal degree in co-relation 2625. Up to 498 conditions per place. [2021-03-25 05:03:52,384 INFO L142 LiptonReduction]: Number of co-enabled transitions 506 [2021-03-25 05:03:52,401 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-25 05:03:52,401 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:03:52,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-25 05:03:52,403 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 232 flow [2021-03-25 05:03:52,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 188.25) internal successors, (753), 4 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:52,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:52,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 05:03:52,404 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -309517514, now seen corresponding path program 2 times [2021-03-25 05:03:52,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:52,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521027583] [2021-03-25 05:03:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:52,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:52,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:52,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:52,490 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:03:52,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:03:52,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:52,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521027583] [2021-03-25 05:03:52,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:52,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:03:52,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357399644] [2021-03-25 05:03:52,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:03:52,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:52,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:03:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:03:52,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-25 05:03:52,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:52,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-25 05:03:52,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:52,609 INFO L129 PetriNetUnfolder]: 226/527 cut-off events. [2021-03-25 05:03:52,609 INFO L130 PetriNetUnfolder]: For 1007/1800 co-relation queries the response was YES. [2021-03-25 05:03:52,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 527 events. 226/527 cut-off events. For 1007/1800 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3170 event pairs, 14 based on Foata normal form. 193/666 useless extension candidates. Maximal degree in co-relation 2078. Up to 361 conditions per place. [2021-03-25 05:03:52,613 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 6 selfloop transitions, 17 changer transitions 5/54 dead transitions. [2021-03-25 05:03:52,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 390 flow [2021-03-25 05:03:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:03:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:03:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1332 transitions. [2021-03-25 05:03:52,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8850498338870432 [2021-03-25 05:03:52,617 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1332 transitions. [2021-03-25 05:03:52,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1332 transitions. [2021-03-25 05:03:52,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:52,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1332 transitions. [2021-03-25 05:03:52,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 190.28571428571428) internal successors, (1332), 7 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 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-25 05:03:52,624 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 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-25 05:03:52,624 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 232 flow. Second operand 7 states and 1332 transitions. [2021-03-25 05:03:52,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 390 flow [2021-03-25 05:03:52,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:03:52,627 INFO L241 Difference]: Finished difference. Result has 61 places, 49 transitions, 353 flow [2021-03-25 05:03:52,627 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2021-03-25 05:03:52,627 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2021-03-25 05:03:52,627 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:52,627 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 353 flow [2021-03-25 05:03:52,628 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 49 transitions, 353 flow [2021-03-25 05:03:52,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 353 flow [2021-03-25 05:03:52,676 INFO L129 PetriNetUnfolder]: 223/560 cut-off events. [2021-03-25 05:03:52,676 INFO L130 PetriNetUnfolder]: For 1821/2149 co-relation queries the response was YES. [2021-03-25 05:03:52,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 560 events. 223/560 cut-off events. For 1821/2149 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3832 event pairs, 18 based on Foata normal form. 18/533 useless extension candidates. Maximal degree in co-relation 2439. Up to 385 conditions per place. [2021-03-25 05:03:52,683 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-25 05:03:52,717 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-25 05:03:52,717 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:03:52,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-25 05:03:52,718 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 343 flow [2021-03-25 05:03:52,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:52,718 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:52,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 05:03:52,719 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash -770546719, now seen corresponding path program 1 times [2021-03-25 05:03:52,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:52,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528389962] [2021-03-25 05:03:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:52,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:03:52,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:03:52,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 05:03:52,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 05:03:52,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 05:03:52,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:52,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 05:03:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:52,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528389962] [2021-03-25 05:03:52,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:52,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:03:52,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439918172] [2021-03-25 05:03:52,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:03:52,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:52,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:03:52,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:03:52,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 215 [2021-03-25 05:03:52,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:52,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:52,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 215 [2021-03-25 05:03:52,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:53,120 INFO L129 PetriNetUnfolder]: 374/850 cut-off events. [2021-03-25 05:03:53,120 INFO L130 PetriNetUnfolder]: For 3024/3653 co-relation queries the response was YES. [2021-03-25 05:03:53,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 850 events. 374/850 cut-off events. For 3024/3653 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5579 event pairs, 24 based on Foata normal form. 37/804 useless extension candidates. Maximal degree in co-relation 3583. Up to 489 conditions per place. [2021-03-25 05:03:53,127 INFO L132 encePairwiseOnDemand]: 205/215 looper letters, 17 selfloop transitions, 14 changer transitions 1/60 dead transitions. [2021-03-25 05:03:53,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 442 flow [2021-03-25 05:03:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:03:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:03:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2021-03-25 05:03:53,131 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.775968992248062 [2021-03-25 05:03:53,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1001 transitions. [2021-03-25 05:03:53,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1001 transitions. [2021-03-25 05:03:53,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:53,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1001 transitions. [2021-03-25 05:03:53,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,136 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,136 INFO L185 Difference]: Start difference. First operand has 61 places, 48 transitions, 343 flow. Second operand 6 states and 1001 transitions. [2021-03-25 05:03:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 442 flow [2021-03-25 05:03:53,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 387 flow, removed 21 selfloop flow, removed 4 redundant places. [2021-03-25 05:03:53,148 INFO L241 Difference]: Finished difference. Result has 63 places, 52 transitions, 355 flow [2021-03-25 05:03:53,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2021-03-25 05:03:53,148 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2021-03-25 05:03:53,148 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:53,149 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 52 transitions, 355 flow [2021-03-25 05:03:53,149 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 52 transitions, 355 flow [2021-03-25 05:03:53,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 355 flow [2021-03-25 05:03:53,215 INFO L129 PetriNetUnfolder]: 338/784 cut-off events. [2021-03-25 05:03:53,215 INFO L130 PetriNetUnfolder]: For 1758/1937 co-relation queries the response was YES. [2021-03-25 05:03:53,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 784 events. 338/784 cut-off events. For 1758/1937 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5363 event pairs, 30 based on Foata normal form. 27/742 useless extension candidates. Maximal degree in co-relation 2749. Up to 342 conditions per place. [2021-03-25 05:03:53,225 INFO L142 LiptonReduction]: Number of co-enabled transitions 574 [2021-03-25 05:03:53,232 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 05:03:53,232 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:03:53,232 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-25 05:03:53,233 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 355 flow [2021-03-25 05:03:53,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,234 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:03:53,234 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:03:53,234 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 05:03:53,234 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:03:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:03:53,234 INFO L82 PathProgramCache]: Analyzing trace with hash -509108837, now seen corresponding path program 1 times [2021-03-25 05:03:53,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:03:53,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162751955] [2021-03-25 05:03:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:03:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:03:53,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:53,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:53,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:53,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:53,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:53,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:53,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:53,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:03:53,361 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:03:53,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:03:53,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:03:53,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:03:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 05:03:53,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162751955] [2021-03-25 05:03:53,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:03:53,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 05:03:53,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43451981] [2021-03-25 05:03:53,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:03:53,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:03:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:03:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:03:53,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-25 05:03:53,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 355 flow. Second operand has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:03:53,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-25 05:03:53,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:03:53,524 INFO L129 PetriNetUnfolder]: 277/658 cut-off events. [2021-03-25 05:03:53,524 INFO L130 PetriNetUnfolder]: For 1644/2709 co-relation queries the response was YES. [2021-03-25 05:03:53,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 658 events. 277/658 cut-off events. For 1644/2709 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 4370 event pairs, 11 based on Foata normal form. 333/921 useless extension candidates. Maximal degree in co-relation 2721. Up to 297 conditions per place. [2021-03-25 05:03:53,530 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 2 selfloop transitions, 18 changer transitions 13/57 dead transitions. [2021-03-25 05:03:53,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 57 transitions, 451 flow [2021-03-25 05:03:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 05:03:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 05:03:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1514 transitions. [2021-03-25 05:03:53,534 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8802325581395349 [2021-03-25 05:03:53,534 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1514 transitions. [2021-03-25 05:03:53,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1514 transitions. [2021-03-25 05:03:53,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:03:53,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1514 transitions. [2021-03-25 05:03:53,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 189.25) internal successors, (1514), 8 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,541 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:03:53,541 INFO L185 Difference]: Start difference. First operand has 63 places, 52 transitions, 355 flow. Second operand 8 states and 1514 transitions. [2021-03-25 05:03:53,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 57 transitions, 451 flow [2021-03-25 05:03:53,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 57 transitions, 403 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-25 05:03:53,550 INFO L241 Difference]: Finished difference. Result has 68 places, 44 transitions, 320 flow [2021-03-25 05:03:53,550 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=320, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2021-03-25 05:03:53,550 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2021-03-25 05:03:53,550 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:03:53,551 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 44 transitions, 320 flow [2021-03-25 05:03:53,552 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 44 transitions, 320 flow [2021-03-25 05:03:53,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 44 transitions, 320 flow [2021-03-25 05:03:53,565 INFO L129 PetriNetUnfolder]: 56/147 cut-off events. [2021-03-25 05:03:53,566 INFO L130 PetriNetUnfolder]: For 347/415 co-relation queries the response was YES. [2021-03-25 05:03:53,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 147 events. 56/147 cut-off events. For 347/415 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 609 event pairs, 1 based on Foata normal form. 4/138 useless extension candidates. Maximal degree in co-relation 590. Up to 61 conditions per place. [2021-03-25 05:03:53,567 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-25 05:03:53,684 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 05:03:53,804 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 05:03:54,003 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 05:03:54,189 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 05:03:56,047 WARN L205 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 363 DAG size of output: 361 [2021-03-25 05:03:57,218 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 361 [2021-03-25 05:03:59,764 WARN L205 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 530 [2021-03-25 05:04:01,903 WARN L205 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 530 [2021-03-25 05:04:03,625 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 308 DAG size of output: 256 [2021-03-25 05:04:04,096 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2021-03-25 05:04:07,225 WARN L205 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 420 DAG size of output: 339 [2021-03-25 05:04:08,122 WARN L205 SmtUtils]: Spent 891.00 ms on a formula simplification that was a NOOP. DAG size: 316 [2021-03-25 05:04:08,130 INFO L154 LiptonReduction]: Checked pairs total: 53 [2021-03-25 05:04:08,130 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 05:04:08,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14580 [2021-03-25 05:04:08,131 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 303 flow [2021-03-25 05:04:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:04:08,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:04:08,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:04:08,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 05:04:08,132 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:04:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:04:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1434385762, now seen corresponding path program 1 times [2021-03-25 05:04:08,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:04:08,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422606749] [2021-03-25 05:04:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:04:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:04:08,205 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:04:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:04:08,277 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:04:08,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:04:08,323 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:04:08,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 05:04:08,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:04:08 BasicIcfg [2021-03-25 05:04:08,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:04:08,454 INFO L168 Benchmark]: Toolchain (without parser) took 53382.97 ms. Allocated memory was 255.9 MB in the beginning and 853.5 MB in the end (delta: 597.7 MB). Free memory was 233.7 MB in the beginning and 710.8 MB in the end (delta: -477.2 MB). Peak memory consumption was 121.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:08,454 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 168.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:04:08,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.46 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.7 MB in the beginning and 323.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:08,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.40 ms. Allocated memory is still 367.0 MB. Free memory was 323.0 MB in the beginning and 320.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:08,460 INFO L168 Benchmark]: Boogie Preprocessor took 30.71 ms. Allocated memory is still 367.0 MB. Free memory was 320.1 MB in the beginning and 317.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:08,460 INFO L168 Benchmark]: RCFGBuilder took 3019.86 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 317.3 MB in the beginning and 315.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:08,460 INFO L168 Benchmark]: TraceAbstraction took 49629.09 ms. Allocated memory was 440.4 MB in the beginning and 853.5 MB in the end (delta: 413.1 MB). Free memory was 315.5 MB in the beginning and 710.8 MB in the end (delta: -395.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.0 GB. [2021-03-25 05:04:08,461 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.55 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 168.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 620.46 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.7 MB in the beginning and 323.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.40 ms. Allocated memory is still 367.0 MB. Free memory was 323.0 MB in the beginning and 320.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.71 ms. Allocated memory is still 367.0 MB. Free memory was 320.1 MB in the beginning and 317.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3019.86 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 317.3 MB in the beginning and 315.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 49629.09 ms. Allocated memory was 440.4 MB in the beginning and 853.5 MB in the end (delta: 413.1 MB). Free memory was 315.5 MB in the beginning and 710.8 MB in the end (delta: -395.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25121.6ms, 122 PlacesBefore, 56 PlacesAfterwards, 110 TransitionsBefore, 44 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 4 FixpointIterations, 39 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 69 TotalNumberOfCompositions, 1852 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 994, positive: 940, positive conditional: 0, positive unconditional: 940, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 687, positive: 655, positive conditional: 0, positive unconditional: 655, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 687, positive: 655, positive conditional: 0, positive unconditional: 655, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 994, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 687, unknown conditional: 0, unknown unconditional: 687] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1200.6ms, 54 PlacesBefore, 41 PlacesAfterwards, 44 TransitionsBefore, 31 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 3 FixpointIterations, 13 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 759 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 222, positive: 174, positive conditional: 0, positive unconditional: 174, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 222, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1449.9ms, 44 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 3 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 189, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2231.4ms, 40 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 60, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1ms, 41 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 260 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 37, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.4ms, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 27, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.2ms, 44 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 184 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.5ms, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 113 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 33, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.1ms, 49 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 41 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 110.1ms, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 121 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 39, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.5ms, 61 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 17, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.9ms, 63 PlacesBefore, 63 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14578.5ms, 68 PlacesBefore, 60 PlacesAfterwards, 44 TransitionsBefore, 39 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 53 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 45, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L770] EXPR 1 !y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))) [L770] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L771] EXPR 1 !y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))) [L771] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] EXPR 1 !y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] EXPR 1 !y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] EXPR 1 !y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L774] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] EXPR 1 !y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L775] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] EXPR 1 \read(y) [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2146; [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2147; [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L858] 0 pthread_t t2148; [L810] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 4 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] EXPR 0 \read(y) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 49323.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1710.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25210.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 53 SDtfs, 33 SDslu, 19 SDs, 0 SdLazy, 306 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 374.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 367.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=12, InterpolantAutomatonStates: 61, 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: 64.0ms SsaConstructionTime, 772.0ms SatisfiabilityAnalysisTime, 1083.4ms InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...