/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 20:49:03,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 20:49:03,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 20:49:03,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 20:49:03,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 20:49:03,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 20:49:03,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 20:49:03,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 20:49:03,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 20:49:03,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 20:49:03,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 20:49:03,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 20:49:03,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 20:49:03,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 20:49:03,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 20:49:03,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 20:49:03,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 20:49:03,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 20:49:03,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 20:49:03,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 20:49:03,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 20:49:03,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 20:49:03,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 20:49:03,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 20:49:03,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 20:49:03,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 20:49:03,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 20:49:03,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 20:49:03,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 20:49:03,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 20:49:03,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 20:49:03,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 20:49:03,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 20:49:03,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 20:49:03,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 20:49:03,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 20:49:03,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 20:49:03,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 20:49:03,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 20:49:03,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 20:49:03,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 20:49:03,930 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-SemanticLbe.epf [2021-06-10 20:49:03,966 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 20:49:03,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 20:49:03,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 20:49:03,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 20:49:03,969 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 20:49:03,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 20:49:03,970 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 20:49:03,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 20:49:03,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 20:49:03,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 20:49:03,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 20:49:03,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 20:49:03,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 20:49:03,972 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 20:49:03,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 20:49:03,972 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 20:49:03,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 20:49:03,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 20:49:03,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 20:49:03,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 20:49:03,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 20:49:03,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:49:03,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 20:49:03,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 20:49:03,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 20:49:03,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 20:49:03,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 20:49:03,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 20:49:03,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 20:49:04,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 20:49:04,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 20:49:04,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 20:49:04,307 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 20:49:04,309 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 20:49:04,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2021-06-10 20:49:04,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e801b98e1/57144dc0270a40ac820d2818e012122d/FLAGf038b9aa9 [2021-06-10 20:49:05,102 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 20:49:05,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc.i [2021-06-10 20:49:05,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e801b98e1/57144dc0270a40ac820d2818e012122d/FLAGf038b9aa9 [2021-06-10 20:49:05,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e801b98e1/57144dc0270a40ac820d2818e012122d [2021-06-10 20:49:05,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 20:49:05,182 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 20:49:05,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 20:49:05,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 20:49:05,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 20:49:05,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7724e63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05, skipping insertion in model container [2021-06-10 20:49:05,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 20:49:05,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 20:49:05,358 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/mix024_power.oepc.i[951,964] [2021-06-10 20:49:05,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:49:05,589 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 20:49:05,597 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/mix024_power.oepc.i[951,964] [2021-06-10 20:49:05,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:49:05,699 INFO L208 MainTranslator]: Completed translation [2021-06-10 20:49:05,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05 WrapperNode [2021-06-10 20:49:05,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 20:49:05,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 20:49:05,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 20:49:05,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 20:49:05,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 20:49:05,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 20:49:05,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 20:49:05,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 20:49:05,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... [2021-06-10 20:49:05,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 20:49:05,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 20:49:05,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 20:49:05,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 20:49:05,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:49:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 20:49:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 20:49:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 20:49:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 20:49:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 20:49:05,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 20:49:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 20:49:05,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 20:49:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 20:49:05,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 20:49:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 20:49:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 20:49:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 20:49:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 20:49:05,907 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 20:49:07,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 20:49:07,786 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 20:49:07,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:49:07 BoogieIcfgContainer [2021-06-10 20:49:07,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 20:49:07,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 20:49:07,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 20:49:07,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 20:49:07,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 08:49:05" (1/3) ... [2021-06-10 20:49:07,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48497303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:49:07, skipping insertion in model container [2021-06-10 20:49:07,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:49:05" (2/3) ... [2021-06-10 20:49:07,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48497303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:49:07, skipping insertion in model container [2021-06-10 20:49:07,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:49:07" (3/3) ... [2021-06-10 20:49:07,794 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc.i [2021-06-10 20:49:07,799 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 20:49:07,803 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 20:49:07,803 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 20:49:07,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,835 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,835 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,862 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,862 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:49:07,869 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 20:49:07,885 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 20:49:07,903 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 20:49:07,903 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 20:49:07,903 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 20:49:07,903 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 20:49:07,904 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 20:49:07,904 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 20:49:07,904 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 20:49:07,904 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 20:49:07,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-06-10 20:49:07,947 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-06-10 20:49:07,947 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:49:07,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-06-10 20:49:07,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-06-10 20:49:07,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-06-10 20:49:07,957 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 20:49:07,969 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 211 flow [2021-06-10 20:49:07,972 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 211 flow [2021-06-10 20:49:07,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 211 flow [2021-06-10 20:49:08,009 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-06-10 20:49:08,009 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:49:08,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-06-10 20:49:08,015 INFO L151 LiptonReduction]: Number of co-enabled transitions 1978 [2021-06-10 20:49:08,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:08,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:08,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:08,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:08,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:08,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:08,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:08,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:08,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,061 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 20:49:09,061 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:49:09,086 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:09,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:09,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:09,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,395 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:09,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:09,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:09,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,587 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 20:49:09,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:09,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:09,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:10,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:10,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:10,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:10,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:10,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:10,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:10,488 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 20:49:10,886 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-10 20:49:11,022 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-10 20:49:11,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:11,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 20:49:11,041 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:11,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,044 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-10 20:49:11,044 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:49:11,046 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,049 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-10 20:49:11,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:11,051 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-10 20:49:11,051 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-10 20:49:11,052 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:49:11,053 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,056 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-10 20:49:11,057 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-10 20:49:11,057 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:49:11,058 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,063 INFO L147 QuantifierPusher]: treesize reduction 189, result has 28.4 percent of original size 75 [2021-06-10 20:49:11,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:11,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:11,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:11,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,605 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 20:49:11,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:11,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:11,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:12,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:12,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:12,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:12,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:12,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:12,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:12,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:12,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,922 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 20:49:12,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:12,923 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 20:49:12,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 20:49:12,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:12,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:12,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 20:49:12,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 20:49:13,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:13,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:13,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:13,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:13,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:13,571 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-10 20:49:13,712 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-10 20:49:14,074 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-10 20:49:14,212 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-10 20:49:14,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:14,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:49:14,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:14,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:14,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:49:14,234 INFO L163 LiptonReduction]: Checked pairs total: 6462 [2021-06-10 20:49:14,234 INFO L165 LiptonReduction]: Total number of compositions: 94 [2021-06-10 20:49:14,236 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6281 [2021-06-10 20:49:14,242 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 20:49:14,242 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:49:14,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:14,243 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-10 20:49:14,243 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1087212, now seen corresponding path program 1 times [2021-06-10 20:49:14,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:14,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699841056] [2021-06-10 20:49:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:14,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:14,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:14,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699841056] [2021-06-10 20:49:14,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:14,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:49:14,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376024562] [2021-06-10 20:49:14,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:49:14,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:14,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:49:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:49:14,438 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-06-10 20:49:14,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:14,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-06-10 20:49:14,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:14,536 INFO L129 PetriNetUnfolder]: 49/140 cut-off events. [2021-06-10 20:49:14,536 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:49:14,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 140 events. 49/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 619 event pairs, 38 based on Foata normal form. 36/161 useless extension candidates. Maximal degree in co-relation 226. Up to 65 conditions per place. [2021-06-10 20:49:14,539 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 9 selfloop transitions, 2 changer transitions 1/31 dead transitions. [2021-06-10 20:49:14,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 93 flow [2021-06-10 20:49:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:49:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:49:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2021-06-10 20:49:14,556 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8602693602693603 [2021-06-10 20:49:14,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2021-06-10 20:49:14,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2021-06-10 20:49:14,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:14,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2021-06-10 20:49:14,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,578 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 511 transitions. [2021-06-10 20:49:14,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 93 flow [2021-06-10 20:49:14,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 20:49:14,581 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 62 flow [2021-06-10 20:49:14,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-06-10 20:49:14,583 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2021-06-10 20:49:14,584 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 62 flow [2021-06-10 20:49:14,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:14,586 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:14,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 20:49:14,586 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2069111556, now seen corresponding path program 1 times [2021-06-10 20:49:14,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:14,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067775464] [2021-06-10 20:49:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:14,691 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:49:14,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:49:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:14,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067775464] [2021-06-10 20:49:14,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:14,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:49:14,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510049108] [2021-06-10 20:49:14,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:49:14,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:14,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:49:14,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:49:14,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 198 [2021-06-10 20:49:14,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:14,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 198 [2021-06-10 20:49:14,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:14,798 INFO L129 PetriNetUnfolder]: 148/397 cut-off events. [2021-06-10 20:49:14,799 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:49:14,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 397 events. 148/397 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2514 event pairs, 52 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 661. Up to 181 conditions per place. [2021-06-10 20:49:14,803 INFO L132 encePairwiseOnDemand]: 189/198 looper letters, 7 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-06-10 20:49:14,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 108 flow [2021-06-10 20:49:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:49:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:49:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2021-06-10 20:49:14,806 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7710437710437711 [2021-06-10 20:49:14,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2021-06-10 20:49:14,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2021-06-10 20:49:14,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:14,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2021-06-10 20:49:14,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,810 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 62 flow. Second operand 3 states and 458 transitions. [2021-06-10 20:49:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 108 flow [2021-06-10 20:49:14,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:49:14,811 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 110 flow [2021-06-10 20:49:14,811 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-10 20:49:14,812 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-06-10 20:49:14,812 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 110 flow [2021-06-10 20:49:14,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:14,812 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:14,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 20:49:14,813 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash -282051793, now seen corresponding path program 1 times [2021-06-10 20:49:14,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:14,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159389230] [2021-06-10 20:49:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:14,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:14,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:14,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159389230] [2021-06-10 20:49:14,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:14,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:49:14,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956357075] [2021-06-10 20:49:14,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:49:14,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:14,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:49:14,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:49:14,936 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 198 [2021-06-10 20:49:14,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:14,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 198 [2021-06-10 20:49:14,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:14,971 INFO L129 PetriNetUnfolder]: 57/195 cut-off events. [2021-06-10 20:49:14,971 INFO L130 PetriNetUnfolder]: For 56/66 co-relation queries the response was YES. [2021-06-10 20:49:14,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 195 events. 57/195 cut-off events. For 56/66 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1055 event pairs, 29 based on Foata normal form. 5/195 useless extension candidates. Maximal degree in co-relation 387. Up to 96 conditions per place. [2021-06-10 20:49:14,974 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 1 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-06-10 20:49:14,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 118 flow [2021-06-10 20:49:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:49:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:49:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2021-06-10 20:49:14,977 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8451178451178452 [2021-06-10 20:49:14,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2021-06-10 20:49:14,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2021-06-10 20:49:14,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:14,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2021-06-10 20:49:14,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,980 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 110 flow. Second operand 3 states and 502 transitions. [2021-06-10 20:49:14,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 118 flow [2021-06-10 20:49:14,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:49:14,984 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 107 flow [2021-06-10 20:49:14,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=3, PETRI_FLOW=107, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-10 20:49:14,984 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-06-10 20:49:14,984 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 107 flow [2021-06-10 20:49:14,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:14,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:14,985 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:14,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 20:49:14,985 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1998274882, now seen corresponding path program 1 times [2021-06-10 20:49:14,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:14,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549664804] [2021-06-10 20:49:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:15,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:15,091 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:49:15,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:49:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:15,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549664804] [2021-06-10 20:49:15,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:15,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:49:15,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238095543] [2021-06-10 20:49:15,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:49:15,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:49:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:49:15,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 198 [2021-06-10 20:49:15,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:15,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 198 [2021-06-10 20:49:15,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:15,165 INFO L129 PetriNetUnfolder]: 51/177 cut-off events. [2021-06-10 20:49:15,165 INFO L130 PetriNetUnfolder]: For 41/78 co-relation queries the response was YES. [2021-06-10 20:49:15,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 177 events. 51/177 cut-off events. For 41/78 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 892 event pairs, 8 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 425. Up to 88 conditions per place. [2021-06-10 20:49:15,167 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 8 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2021-06-10 20:49:15,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 168 flow [2021-06-10 20:49:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:49:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:49:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2021-06-10 20:49:15,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2021-06-10 20:49:15,170 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2021-06-10 20:49:15,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2021-06-10 20:49:15,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:15,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2021-06-10 20:49:15,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,174 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,174 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 107 flow. Second operand 4 states and 606 transitions. [2021-06-10 20:49:15,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 168 flow [2021-06-10 20:49:15,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:49:15,176 INFO L241 Difference]: Finished difference. Result has 40 places, 35 transitions, 159 flow [2021-06-10 20:49:15,176 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2021-06-10 20:49:15,177 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2021-06-10 20:49:15,177 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 159 flow [2021-06-10 20:49:15,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:15,177 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:15,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 20:49:15,178 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:15,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1816979787, now seen corresponding path program 1 times [2021-06-10 20:49:15,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:15,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197746590] [2021-06-10 20:49:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:15,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:15,240 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:49:15,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:49:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:15,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197746590] [2021-06-10 20:49:15,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:15,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:49:15,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647092702] [2021-06-10 20:49:15,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:49:15,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:49:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:49:15,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 198 [2021-06-10 20:49:15,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:15,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 198 [2021-06-10 20:49:15,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:15,313 INFO L129 PetriNetUnfolder]: 39/149 cut-off events. [2021-06-10 20:49:15,313 INFO L130 PetriNetUnfolder]: For 122/170 co-relation queries the response was YES. [2021-06-10 20:49:15,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 149 events. 39/149 cut-off events. For 122/170 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 699 event pairs, 6 based on Foata normal form. 7/153 useless extension candidates. Maximal degree in co-relation 418. Up to 70 conditions per place. [2021-06-10 20:49:15,314 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 16 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2021-06-10 20:49:15,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 236 flow [2021-06-10 20:49:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:49:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:49:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2021-06-10 20:49:15,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7613636363636364 [2021-06-10 20:49:15,317 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2021-06-10 20:49:15,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2021-06-10 20:49:15,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:15,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2021-06-10 20:49:15,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,321 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,321 INFO L185 Difference]: Start difference. First operand has 40 places, 35 transitions, 159 flow. Second operand 4 states and 603 transitions. [2021-06-10 20:49:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 236 flow [2021-06-10 20:49:15,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-10 20:49:15,326 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 217 flow [2021-06-10 20:49:15,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2021-06-10 20:49:15,327 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2021-06-10 20:49:15,327 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 217 flow [2021-06-10 20:49:15,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,328 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:15,328 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:15,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 20:49:15,328 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash -522572156, now seen corresponding path program 1 times [2021-06-10 20:49:15,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:15,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484149947] [2021-06-10 20:49:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:15,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:15,404 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 20:49:15,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:15,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:15,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484149947] [2021-06-10 20:49:15,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:15,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:49:15,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998642246] [2021-06-10 20:49:15,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:49:15,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:49:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:49:15,415 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 198 [2021-06-10 20:49:15,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:15,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 198 [2021-06-10 20:49:15,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:15,528 INFO L129 PetriNetUnfolder]: 206/500 cut-off events. [2021-06-10 20:49:15,529 INFO L130 PetriNetUnfolder]: For 260/276 co-relation queries the response was YES. [2021-06-10 20:49:15,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 500 events. 206/500 cut-off events. For 260/276 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3308 event pairs, 64 based on Foata normal form. 40/447 useless extension candidates. Maximal degree in co-relation 1159. Up to 214 conditions per place. [2021-06-10 20:49:15,533 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 8 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2021-06-10 20:49:15,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 275 flow [2021-06-10 20:49:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:49:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:49:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions. [2021-06-10 20:49:15,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8131313131313131 [2021-06-10 20:49:15,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 805 transitions. [2021-06-10 20:49:15,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 805 transitions. [2021-06-10 20:49:15,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:15,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 805 transitions. [2021-06-10 20:49:15,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,541 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 217 flow. Second operand 5 states and 805 transitions. [2021-06-10 20:49:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 275 flow [2021-06-10 20:49:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 270 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 20:49:15,544 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 281 flow [2021-06-10 20:49:15,544 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-06-10 20:49:15,545 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2021-06-10 20:49:15,545 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 281 flow [2021-06-10 20:49:15,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:15,545 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:15,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 20:49:15,545 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1475065912, now seen corresponding path program 1 times [2021-06-10 20:49:15,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:15,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599066842] [2021-06-10 20:49:15,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:15,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:15,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:15,625 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 20:49:15,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:15,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:15,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599066842] [2021-06-10 20:49:15,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:15,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:49:15,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024856653] [2021-06-10 20:49:15,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:49:15,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:49:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:49:15,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 198 [2021-06-10 20:49:15,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:15,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 198 [2021-06-10 20:49:15,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:15,736 INFO L129 PetriNetUnfolder]: 152/414 cut-off events. [2021-06-10 20:49:15,736 INFO L130 PetriNetUnfolder]: For 651/1206 co-relation queries the response was YES. [2021-06-10 20:49:15,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 414 events. 152/414 cut-off events. For 651/1206 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2669 event pairs, 13 based on Foata normal form. 156/525 useless extension candidates. Maximal degree in co-relation 1478. Up to 213 conditions per place. [2021-06-10 20:49:15,741 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 5 selfloop transitions, 18 changer transitions 3/57 dead transitions. [2021-06-10 20:49:15,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 396 flow [2021-06-10 20:49:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:49:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:49:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1127 transitions. [2021-06-10 20:49:15,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8131313131313131 [2021-06-10 20:49:15,744 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1127 transitions. [2021-06-10 20:49:15,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1127 transitions. [2021-06-10 20:49:15,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:15,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1127 transitions. [2021-06-10 20:49:15,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,749 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,749 INFO L185 Difference]: Start difference. First operand has 52 places, 46 transitions, 281 flow. Second operand 7 states and 1127 transitions. [2021-06-10 20:49:15,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 396 flow [2021-06-10 20:49:15,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-10 20:49:15,759 INFO L241 Difference]: Finished difference. Result has 61 places, 54 transitions, 394 flow [2021-06-10 20:49:15,759 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2021-06-10 20:49:15,759 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2021-06-10 20:49:15,759 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 394 flow [2021-06-10 20:49:15,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:15,760 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:15,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 20:49:15,760 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1818596668, now seen corresponding path program 1 times [2021-06-10 20:49:15,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:15,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203555406] [2021-06-10 20:49:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:15,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:15,858 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-06-10 20:49:15,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:49:15,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:15,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 20:49:15,881 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:49:15,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:49:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:15,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203555406] [2021-06-10 20:49:15,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:15,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:49:15,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011806456] [2021-06-10 20:49:15,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 20:49:15,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:15,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 20:49:15,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-10 20:49:15,900 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 198 [2021-06-10 20:49:15,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:15,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:15,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 198 [2021-06-10 20:49:15,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:16,267 INFO L129 PetriNetUnfolder]: 483/1156 cut-off events. [2021-06-10 20:49:16,268 INFO L130 PetriNetUnfolder]: For 5346/7172 co-relation queries the response was YES. [2021-06-10 20:49:16,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 1156 events. 483/1156 cut-off events. For 5346/7172 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 8785 event pairs, 25 based on Foata normal form. 156/1177 useless extension candidates. Maximal degree in co-relation 4822. Up to 512 conditions per place. [2021-06-10 20:49:16,281 INFO L132 encePairwiseOnDemand]: 186/198 looper letters, 33 selfloop transitions, 40 changer transitions 2/103 dead transitions. [2021-06-10 20:49:16,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 871 flow [2021-06-10 20:49:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-10 20:49:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-10 20:49:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1053 transitions. [2021-06-10 20:49:16,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6647727272727273 [2021-06-10 20:49:16,284 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1053 transitions. [2021-06-10 20:49:16,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1053 transitions. [2021-06-10 20:49:16,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:16,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1053 transitions. [2021-06-10 20:49:16,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.625) internal successors, (1053), 8 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,290 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,290 INFO L185 Difference]: Start difference. First operand has 61 places, 54 transitions, 394 flow. Second operand 8 states and 1053 transitions. [2021-06-10 20:49:16,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 871 flow [2021-06-10 20:49:16,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 828 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-06-10 20:49:16,352 INFO L241 Difference]: Finished difference. Result has 69 places, 84 transitions, 731 flow [2021-06-10 20:49:16,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=69, PETRI_TRANSITIONS=84} [2021-06-10 20:49:16,352 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2021-06-10 20:49:16,352 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 84 transitions, 731 flow [2021-06-10 20:49:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:16,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:16,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 20:49:16,353 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1661938286, now seen corresponding path program 2 times [2021-06-10 20:49:16,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:16,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286447944] [2021-06-10 20:49:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:16,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:16,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:16,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:16,436 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 20:49:16,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:49:16,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:16,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286447944] [2021-06-10 20:49:16,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:16,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 20:49:16,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824786526] [2021-06-10 20:49:16,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 20:49:16,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 20:49:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 20:49:16,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 198 [2021-06-10 20:49:16,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 84 transitions, 731 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:16,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 198 [2021-06-10 20:49:16,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:16,656 INFO L129 PetriNetUnfolder]: 349/891 cut-off events. [2021-06-10 20:49:16,656 INFO L130 PetriNetUnfolder]: For 4295/6430 co-relation queries the response was YES. [2021-06-10 20:49:16,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 891 events. 349/891 cut-off events. For 4295/6430 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 6743 event pairs, 10 based on Foata normal form. 558/1343 useless extension candidates. Maximal degree in co-relation 3803. Up to 274 conditions per place. [2021-06-10 20:49:16,665 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 3 selfloop transitions, 22 changer transitions 5/87 dead transitions. [2021-06-10 20:49:16,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 801 flow [2021-06-10 20:49:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 20:49:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 20:49:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1443 transitions. [2021-06-10 20:49:16,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8097643097643098 [2021-06-10 20:49:16,669 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1443 transitions. [2021-06-10 20:49:16,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1443 transitions. [2021-06-10 20:49:16,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:16,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1443 transitions. [2021-06-10 20:49:16,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.33333333333334) internal successors, (1443), 9 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,675 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,675 INFO L185 Difference]: Start difference. First operand has 69 places, 84 transitions, 731 flow. Second operand 9 states and 1443 transitions. [2021-06-10 20:49:16,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 801 flow [2021-06-10 20:49:16,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 87 transitions, 784 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-06-10 20:49:16,700 INFO L241 Difference]: Finished difference. Result has 77 places, 82 transitions, 748 flow [2021-06-10 20:49:16,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=748, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2021-06-10 20:49:16,700 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2021-06-10 20:49:16,700 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 748 flow [2021-06-10 20:49:16,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:16,701 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:16,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 20:49:16,701 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1467505702, now seen corresponding path program 1 times [2021-06-10 20:49:16,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:16,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928558098] [2021-06-10 20:49:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:16,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:16,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:16,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:16,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:16,752 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:49:16,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:49:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:16,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928558098] [2021-06-10 20:49:16,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:16,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:49:16,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103608387] [2021-06-10 20:49:16,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:49:16,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:16,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:49:16,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:49:16,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198 [2021-06-10 20:49:16,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:16,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198 [2021-06-10 20:49:16,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:16,950 INFO L129 PetriNetUnfolder]: 485/1272 cut-off events. [2021-06-10 20:49:16,951 INFO L130 PetriNetUnfolder]: For 5872/6475 co-relation queries the response was YES. [2021-06-10 20:49:16,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5638 conditions, 1272 events. 485/1272 cut-off events. For 5872/6475 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 10791 event pairs, 3 based on Foata normal form. 48/1166 useless extension candidates. Maximal degree in co-relation 5604. Up to 398 conditions per place. [2021-06-10 20:49:16,963 INFO L132 encePairwiseOnDemand]: 189/198 looper letters, 11 selfloop transitions, 21 changer transitions 42/113 dead transitions. [2021-06-10 20:49:16,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 113 transitions, 1189 flow [2021-06-10 20:49:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 20:49:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 20:49:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 886 transitions. [2021-06-10 20:49:16,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7457912457912458 [2021-06-10 20:49:16,966 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 886 transitions. [2021-06-10 20:49:16,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 886 transitions. [2021-06-10 20:49:16,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:16,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 886 transitions. [2021-06-10 20:49:16,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,970 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:16,970 INFO L185 Difference]: Start difference. First operand has 77 places, 82 transitions, 748 flow. Second operand 6 states and 886 transitions. [2021-06-10 20:49:16,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 113 transitions, 1189 flow [2021-06-10 20:49:17,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 1115 flow, removed 17 selfloop flow, removed 8 redundant places. [2021-06-10 20:49:17,047 INFO L241 Difference]: Finished difference. Result has 75 places, 67 transitions, 568 flow [2021-06-10 20:49:17,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2021-06-10 20:49:17,047 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2021-06-10 20:49:17,047 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 568 flow [2021-06-10 20:49:17,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:17,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:17,048 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:17,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 20:49:17,048 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash 555104882, now seen corresponding path program 2 times [2021-06-10 20:49:17,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:17,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88794911] [2021-06-10 20:49:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:49:17,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:17,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:49:17,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:49:17,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:49:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:49:17,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88794911] [2021-06-10 20:49:17,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:49:17,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 20:49:17,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875658006] [2021-06-10 20:49:17,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:49:17,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:49:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:49:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:49:17,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 198 [2021-06-10 20:49:17,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:17,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:49:17,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 198 [2021-06-10 20:49:17,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:49:17,188 INFO L129 PetriNetUnfolder]: 242/696 cut-off events. [2021-06-10 20:49:17,189 INFO L130 PetriNetUnfolder]: For 1546/1574 co-relation queries the response was YES. [2021-06-10 20:49:17,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 696 events. 242/696 cut-off events. For 1546/1574 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 5354 event pairs, 4 based on Foata normal form. 14/633 useless extension candidates. Maximal degree in co-relation 2649. Up to 232 conditions per place. [2021-06-10 20:49:17,194 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 4 selfloop transitions, 5 changer transitions 15/67 dead transitions. [2021-06-10 20:49:17,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 606 flow [2021-06-10 20:49:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:49:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:49:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-06-10 20:49:17,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2021-06-10 20:49:17,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-06-10 20:49:17,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-06-10 20:49:17,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:49:17,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-06-10 20:49:17,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:17,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:17,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:17,199 INFO L185 Difference]: Start difference. First operand has 75 places, 67 transitions, 568 flow. Second operand 3 states and 500 transitions. [2021-06-10 20:49:17,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 606 flow [2021-06-10 20:49:17,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 513 flow, removed 2 selfloop flow, removed 8 redundant places. [2021-06-10 20:49:17,220 INFO L241 Difference]: Finished difference. Result has 69 places, 52 transitions, 336 flow [2021-06-10 20:49:17,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2021-06-10 20:49:17,220 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2021-06-10 20:49:17,221 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 336 flow [2021-06-10 20:49:17,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:49:17,221 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:49:17,221 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:49:17,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 20:49:17,221 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:49:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:49:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2120226698, now seen corresponding path program 3 times [2021-06-10 20:49:17,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:49:17,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155649133] [2021-06-10 20:49:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:49:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:49:17,261 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:49:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:49:17,301 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:49:17,326 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 20:49:17,326 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 20:49:17,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 20:49:17,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 08:49:17 BasicIcfg [2021-06-10 20:49:17,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 20:49:17,421 INFO L168 Benchmark]: Toolchain (without parser) took 12239.19 ms. Allocated memory was 373.3 MB in the beginning and 606.1 MB in the end (delta: 232.8 MB). Free memory was 336.2 MB in the beginning and 272.3 MB in the end (delta: 63.9 MB). Peak memory consumption was 299.7 MB. Max. memory is 16.0 GB. [2021-06-10 20:49:17,421 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 373.3 MB. Free memory is still 354.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 20:49:17,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.61 ms. Allocated memory is still 373.3 MB. Free memory was 336.1 MB in the beginning and 334.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-06-10 20:49:17,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 373.3 MB. Free memory was 334.4 MB in the beginning and 331.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-10 20:49:17,422 INFO L168 Benchmark]: Boogie Preprocessor took 52.96 ms. Allocated memory is still 373.3 MB. Free memory was 331.2 MB in the beginning and 328.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 20:49:17,422 INFO L168 Benchmark]: RCFGBuilder took 1970.04 ms. Allocated memory is still 373.3 MB. Free memory was 328.6 MB in the beginning and 267.4 MB in the end (delta: 61.2 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.0 GB. [2021-06-10 20:49:17,422 INFO L168 Benchmark]: TraceAbstraction took 9631.67 ms. Allocated memory was 373.3 MB in the beginning and 606.1 MB in the end (delta: 232.8 MB). Free memory was 267.4 MB in the beginning and 272.3 MB in the end (delta: -4.9 MB). Peak memory consumption was 227.9 MB. Max. memory is 16.0 GB. [2021-06-10 20:49:17,423 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 373.3 MB. Free memory is still 354.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 516.61 ms. Allocated memory is still 373.3 MB. Free memory was 336.1 MB in the beginning and 334.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.58 ms. Allocated memory is still 373.3 MB. Free memory was 334.4 MB in the beginning and 331.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 52.96 ms. Allocated memory is still 373.3 MB. Free memory was 331.2 MB in the beginning and 328.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1970.04 ms. Allocated memory is still 373.3 MB. Free memory was 328.6 MB in the beginning and 267.4 MB in the end (delta: 61.2 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9631.67 ms. Allocated memory was 373.3 MB in the beginning and 606.1 MB in the end (delta: 232.8 MB). Free memory was 267.4 MB in the beginning and 272.3 MB in the end (delta: -4.9 MB). Peak memory consumption was 227.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6262.2ms, 109 PlacesBefore, 39 PlacesAfterwards, 101 TransitionsBefore, 30 TransitionsAfterwards, 1978 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 6462 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2760, positive: 2559, positive conditional: 0, positive unconditional: 2559, negative: 201, negative conditional: 0, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1438, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1438, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1438, positive: 1355, positive conditional: 0, positive unconditional: 1355, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 867, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 791, negative conditional: 0, negative unconditional: 791, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2760, positive: 1185, positive conditional: 0, positive unconditional: 1185, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 1438, unknown conditional: 0, unknown unconditional: 1438] , Statistics on independence cache: Total cache size (in pairs): 2556, Positive cache size: 2497, Positive conditional cache size: 0, Positive unconditional cache size: 2497, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9427.6ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1805.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6336.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 89 SDtfs, 68 SDslu, 60 SDs, 0 SdLazy, 255 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 346.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 240.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=748occurred in iteration=9, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.0ms SsaConstructionTime, 313.8ms SatisfiabilityAnalysisTime, 652.7ms InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...