/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 02:15:34,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 02:15:34,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 02:15:34,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 02:15:34,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 02:15:34,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 02:15:34,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 02:15:34,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 02:15:34,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 02:15:34,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 02:15:34,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 02:15:34,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 02:15:34,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 02:15:34,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 02:15:34,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 02:15:34,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 02:15:34,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 02:15:34,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 02:15:34,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 02:15:34,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 02:15:34,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 02:15:34,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 02:15:34,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 02:15:34,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 02:15:34,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 02:15:34,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 02:15:34,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 02:15:34,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 02:15:34,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 02:15:34,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 02:15:34,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 02:15:34,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 02:15:34,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 02:15:34,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 02:15:34,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 02:15:34,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 02:15:34,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 02:15:34,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 02:15:34,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 02:15:34,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 02:15:34,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 02:15:34,953 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-NoLbe.epf [2021-03-11 02:15:34,985 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 02:15:34,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 02:15:34,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 02:15:34,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 02:15:34,987 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 02:15:34,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 02:15:34,988 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 02:15:34,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 02:15:34,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 02:15:34,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 02:15:34,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 02:15:34,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 02:15:34,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:15:34,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 02:15:34,990 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-11 02:15:34,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 02:15:34,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 02:15:35,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 02:15:35,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 02:15:35,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 02:15:35,238 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 02:15:35,238 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 02:15:35,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2021-03-11 02:15:35,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f3dd84a/8aebf76909604743b6979cdf8addbcfa/FLAG15ef43b1d [2021-03-11 02:15:35,728 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 02:15:35,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2021-03-11 02:15:35,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f3dd84a/8aebf76909604743b6979cdf8addbcfa/FLAG15ef43b1d [2021-03-11 02:15:35,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f3dd84a/8aebf76909604743b6979cdf8addbcfa [2021-03-11 02:15:35,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 02:15:35,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 02:15:35,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 02:15:35,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 02:15:35,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 02:15:35,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:15:35" (1/1) ... [2021-03-11 02:15:35,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dddda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:35, skipping insertion in model container [2021-03-11 02:15:35,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:15:35" (1/1) ... [2021-03-11 02:15:35,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 02:15:35,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 02:15:35,864 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/mix019_tso.oepc.i[949,962] [2021-03-11 02:15:36,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:15:36,062 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 02:15:36,070 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/mix019_tso.oepc.i[949,962] [2021-03-11 02:15:36,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:15:36,151 INFO L208 MainTranslator]: Completed translation [2021-03-11 02:15:36,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36 WrapperNode [2021-03-11 02:15:36,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 02:15:36,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 02:15:36,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 02:15:36,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 02:15:36,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 02:15:36,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 02:15:36,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 02:15:36,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 02:15:36,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... [2021-03-11 02:15:36,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 02:15:36,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 02:15:36,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 02:15:36,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 02:15:36,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:15:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 02:15:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 02:15:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 02:15:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 02:15:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 02:15:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 02:15:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 02:15:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 02:15:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 02:15:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 02:15:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 02:15:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 02:15:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 02:15:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 02:15:36,266 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 02:15:37,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 02:15:37,561 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 02:15:37,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:15:37 BoogieIcfgContainer [2021-03-11 02:15:37,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 02:15:37,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 02:15:37,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 02:15:37,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 02:15:37,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 02:15:35" (1/3) ... [2021-03-11 02:15:37,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7451a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:15:37, skipping insertion in model container [2021-03-11 02:15:37,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:15:36" (2/3) ... [2021-03-11 02:15:37,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7451a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:15:37, skipping insertion in model container [2021-03-11 02:15:37,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:15:37" (3/3) ... [2021-03-11 02:15:37,566 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2021-03-11 02:15:37,570 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 02:15:37,573 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 02:15:37,573 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 02:15:37,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:15:37,619 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 02:15:37,631 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 02:15:37,650 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 02:15:37,650 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 02:15:37,650 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 02:15:37,650 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 02:15:37,651 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 02:15:37,651 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 02:15:37,651 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 02:15:37,651 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 02:15:37,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-11 02:15:37,693 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-11 02:15:37,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:15:37,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-11 02:15:37,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-11 02:15:37,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-11 02:15:37,718 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-03-11 02:15:37,719 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:15:37,719 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:37,719 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:37,720 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:37,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1961549766, now seen corresponding path program 1 times [2021-03-11 02:15:37,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:37,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777290903] [2021-03-11 02:15:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:37,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:37,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:37,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:37,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:37,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777290903] [2021-03-11 02:15:37,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:37,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 02:15:37,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280261634] [2021-03-11 02:15:37,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 02:15:37,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 02:15:37,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 02:15:37,952 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 100 [2021-03-11 02:15:37,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:37,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:37,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 100 [2021-03-11 02:15:37,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:38,084 INFO L129 PetriNetUnfolder]: 49/382 cut-off events. [2021-03-11 02:15:38,085 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:15:38,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 382 events. 49/382 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1976 event pairs, 27 based on Foata normal form. 19/378 useless extension candidates. Maximal degree in co-relation 431. Up to 65 conditions per place. [2021-03-11 02:15:38,091 INFO L132 encePairwiseOnDemand]: 95/100 looper letters, 9 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2021-03-11 02:15:38,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 225 flow [2021-03-11 02:15:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 02:15:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 02:15:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2021-03-11 02:15:38,104 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9433333333333334 [2021-03-11 02:15:38,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2021-03-11 02:15:38,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2021-03-11 02:15:38,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:38,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2021-03-11 02:15:38,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,118 INFO L185 Difference]: Start difference. First operand has 105 places, 97 transitions, 203 flow. Second operand 3 states and 283 transitions. [2021-03-11 02:15:38,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 225 flow [2021-03-11 02:15:38,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 97 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 02:15:38,124 INFO L241 Difference]: Finished difference. Result has 102 places, 93 transitions, 196 flow [2021-03-11 02:15:38,126 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2021-03-11 02:15:38,126 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, -3 predicate places. [2021-03-11 02:15:38,126 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 196 flow [2021-03-11 02:15:38,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:38,127 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:38,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 02:15:38,127 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:38,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:38,127 INFO L82 PathProgramCache]: Analyzing trace with hash 627177594, now seen corresponding path program 1 times [2021-03-11 02:15:38,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:38,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665610687] [2021-03-11 02:15:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:38,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:38,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:38,309 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:38,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:38,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:38,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:38,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:38,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665610687] [2021-03-11 02:15:38,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:38,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:15:38,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748949230] [2021-03-11 02:15:38,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:15:38,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:38,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:15:38,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:15:38,335 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 100 [2021-03-11 02:15:38,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:38,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 100 [2021-03-11 02:15:38,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:38,412 INFO L129 PetriNetUnfolder]: 4/130 cut-off events. [2021-03-11 02:15:38,412 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:15:38,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 130 events. 4/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 123. Up to 8 conditions per place. [2021-03-11 02:15:38,414 INFO L132 encePairwiseOnDemand]: 94/100 looper letters, 6 selfloop transitions, 2 changer transitions 23/105 dead transitions. [2021-03-11 02:15:38,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 105 transitions, 262 flow [2021-03-11 02:15:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:15:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:15:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 815 transitions. [2021-03-11 02:15:38,419 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9055555555555556 [2021-03-11 02:15:38,419 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 815 transitions. [2021-03-11 02:15:38,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 815 transitions. [2021-03-11 02:15:38,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:38,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 815 transitions. [2021-03-11 02:15:38,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,423 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,424 INFO L185 Difference]: Start difference. First operand has 102 places, 93 transitions, 196 flow. Second operand 9 states and 815 transitions. [2021-03-11 02:15:38,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 105 transitions, 262 flow [2021-03-11 02:15:38,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 105 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 02:15:38,426 INFO L241 Difference]: Finished difference. Result has 115 places, 82 transitions, 190 flow [2021-03-11 02:15:38,426 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=115, PETRI_TRANSITIONS=82} [2021-03-11 02:15:38,426 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2021-03-11 02:15:38,426 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 82 transitions, 190 flow [2021-03-11 02:15:38,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,427 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:38,427 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:38,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 02:15:38,427 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1466858478, now seen corresponding path program 1 times [2021-03-11 02:15:38,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:38,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200836240] [2021-03-11 02:15:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:38,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:38,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:38,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:15:38,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:15:38,583 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 02:15:38,584 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 02:15:38,606 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:38,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:38,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:38,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:38,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:38,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:38,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200836240] [2021-03-11 02:15:38,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:38,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-11 02:15:38,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363307156] [2021-03-11 02:15:38,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 02:15:38,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 02:15:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 02:15:38,635 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 100 [2021-03-11 02:15:38,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 82 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:38,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 100 [2021-03-11 02:15:38,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:38,898 INFO L129 PetriNetUnfolder]: 300/718 cut-off events. [2021-03-11 02:15:38,899 INFO L130 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2021-03-11 02:15:38,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 718 events. 300/718 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4073 event pairs, 103 based on Foata normal form. 18/720 useless extension candidates. Maximal degree in co-relation 1358. Up to 297 conditions per place. [2021-03-11 02:15:38,902 INFO L132 encePairwiseOnDemand]: 90/100 looper letters, 14 selfloop transitions, 6 changer transitions 34/121 dead transitions. [2021-03-11 02:15:38,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 121 transitions, 394 flow [2021-03-11 02:15:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 02:15:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 02:15:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 947 transitions. [2021-03-11 02:15:38,905 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.860909090909091 [2021-03-11 02:15:38,905 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 947 transitions. [2021-03-11 02:15:38,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 947 transitions. [2021-03-11 02:15:38,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:38,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 947 transitions. [2021-03-11 02:15:38,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.0909090909091) internal successors, (947), 11 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-03-11 02:15:38,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,909 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 100.0) internal successors, (1200), 12 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,909 INFO L185 Difference]: Start difference. First operand has 115 places, 82 transitions, 190 flow. Second operand 11 states and 947 transitions. [2021-03-11 02:15:38,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 121 transitions, 394 flow [2021-03-11 02:15:38,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 121 transitions, 362 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-11 02:15:38,916 INFO L241 Difference]: Finished difference. Result has 107 places, 85 transitions, 234 flow [2021-03-11 02:15:38,917 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=234, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2021-03-11 02:15:38,917 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 2 predicate places. [2021-03-11 02:15:38,917 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 234 flow [2021-03-11 02:15:38,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:38,918 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:38,918 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:38,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 02:15:38,918 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1908682991, now seen corresponding path program 1 times [2021-03-11 02:15:38,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:38,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313958589] [2021-03-11 02:15:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:39,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:39,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:39,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:15:39,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:15:39,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:15:39,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 02:15:39,077 INFO L142 QuantifierPusher]: treesize reduction 27, result has 74.0 percent of original size [2021-03-11 02:15:39,079 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.3 percent of original size 68 [2021-03-11 02:15:39,136 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-11 02:15:39,137 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-11 02:15:39,159 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:39,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:39,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:39,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:39,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:39,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313958589] [2021-03-11 02:15:39,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:39,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-11 02:15:39,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961544659] [2021-03-11 02:15:39,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-11 02:15:39,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:39,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-11 02:15:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-03-11 02:15:39,197 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 100 [2021-03-11 02:15:39,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 234 flow. Second operand has 12 states, 12 states have (on average 79.08333333333333) internal successors, (949), 12 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:39,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:39,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 100 [2021-03-11 02:15:39,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:39,508 INFO L129 PetriNetUnfolder]: 218/553 cut-off events. [2021-03-11 02:15:39,508 INFO L130 PetriNetUnfolder]: For 1055/1109 co-relation queries the response was YES. [2021-03-11 02:15:39,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 553 events. 218/553 cut-off events. For 1055/1109 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2808 event pairs, 136 based on Foata normal form. 12/550 useless extension candidates. Maximal degree in co-relation 1605. Up to 281 conditions per place. [2021-03-11 02:15:39,512 INFO L132 encePairwiseOnDemand]: 87/100 looper letters, 15 selfloop transitions, 13 changer transitions 35/128 dead transitions. [2021-03-11 02:15:39,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 128 transitions, 628 flow [2021-03-11 02:15:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-11 02:15:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-11 02:15:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1311 transitions. [2021-03-11 02:15:39,514 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.819375 [2021-03-11 02:15:39,514 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1311 transitions. [2021-03-11 02:15:39,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1311 transitions. [2021-03-11 02:15:39,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:39,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1311 transitions. [2021-03-11 02:15:39,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 81.9375) internal successors, (1311), 16 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:39,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 100.0) internal successors, (1700), 17 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:39,519 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 100.0) internal successors, (1700), 17 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:39,519 INFO L185 Difference]: Start difference. First operand has 107 places, 85 transitions, 234 flow. Second operand 16 states and 1311 transitions. [2021-03-11 02:15:39,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 128 transitions, 628 flow [2021-03-11 02:15:39,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 600 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-03-11 02:15:39,523 INFO L241 Difference]: Finished difference. Result has 121 places, 91 transitions, 340 flow [2021-03-11 02:15:39,523 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=340, PETRI_PLACES=121, PETRI_TRANSITIONS=91} [2021-03-11 02:15:39,523 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 16 predicate places. [2021-03-11 02:15:39,523 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 91 transitions, 340 flow [2021-03-11 02:15:39,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 79.08333333333333) internal successors, (949), 12 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:39,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:39,523 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:39,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 02:15:39,524 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash -364500619, now seen corresponding path program 1 times [2021-03-11 02:15:39,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:39,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628627273] [2021-03-11 02:15:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:39,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:39,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:39,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:15:39,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:15:39,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 02:15:39,650 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.4 percent of original size [2021-03-11 02:15:39,650 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.9 percent of original size 38 [2021-03-11 02:15:39,672 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:39,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:39,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:39,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:39,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:39,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:39,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628627273] [2021-03-11 02:15:39,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:39,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-11 02:15:39,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970128428] [2021-03-11 02:15:39,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 02:15:39,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 02:15:39,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-11 02:15:39,705 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 100 [2021-03-11 02:15:39,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 91 transitions, 340 flow. Second operand has 10 states, 10 states have (on average 80.2) internal successors, (802), 10 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:39,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:39,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 100 [2021-03-11 02:15:39,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:40,273 INFO L129 PetriNetUnfolder]: 249/625 cut-off events. [2021-03-11 02:15:40,273 INFO L130 PetriNetUnfolder]: For 3377/3556 co-relation queries the response was YES. [2021-03-11 02:15:40,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 625 events. 249/625 cut-off events. For 3377/3556 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3289 event pairs, 22 based on Foata normal form. 27/640 useless extension candidates. Maximal degree in co-relation 2480. Up to 218 conditions per place. [2021-03-11 02:15:40,277 INFO L132 encePairwiseOnDemand]: 87/100 looper letters, 23 selfloop transitions, 14 changer transitions 39/142 dead transitions. [2021-03-11 02:15:40,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 142 transitions, 906 flow [2021-03-11 02:15:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-11 02:15:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-11 02:15:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1416 transitions. [2021-03-11 02:15:40,280 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8329411764705882 [2021-03-11 02:15:40,281 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1416 transitions. [2021-03-11 02:15:40,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1416 transitions. [2021-03-11 02:15:40,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:40,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1416 transitions. [2021-03-11 02:15:40,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 83.29411764705883) internal successors, (1416), 17 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 100.0) internal successors, (1800), 18 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,286 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 100.0) internal successors, (1800), 18 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,286 INFO L185 Difference]: Start difference. First operand has 121 places, 91 transitions, 340 flow. Second operand 17 states and 1416 transitions. [2021-03-11 02:15:40,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 142 transitions, 906 flow [2021-03-11 02:15:40,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 142 transitions, 788 flow, removed 56 selfloop flow, removed 9 redundant places. [2021-03-11 02:15:40,293 INFO L241 Difference]: Finished difference. Result has 131 places, 98 transitions, 439 flow [2021-03-11 02:15:40,294 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=439, PETRI_PLACES=131, PETRI_TRANSITIONS=98} [2021-03-11 02:15:40,294 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 26 predicate places. [2021-03-11 02:15:40,294 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 98 transitions, 439 flow [2021-03-11 02:15:40,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 80.2) internal successors, (802), 10 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,294 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:40,295 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:40,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 02:15:40,295 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2043561553, now seen corresponding path program 1 times [2021-03-11 02:15:40,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:40,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648973161] [2021-03-11 02:15:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:40,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:40,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:40,349 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:15:40,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:40,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:15:40,367 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:15:40,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:40,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:40,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648973161] [2021-03-11 02:15:40,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:40,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:15:40,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777628582] [2021-03-11 02:15:40,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:15:40,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:15:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:15:40,377 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 100 [2021-03-11 02:15:40,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 98 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:40,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 100 [2021-03-11 02:15:40,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:40,547 INFO L129 PetriNetUnfolder]: 337/1003 cut-off events. [2021-03-11 02:15:40,548 INFO L130 PetriNetUnfolder]: For 3802/3954 co-relation queries the response was YES. [2021-03-11 02:15:40,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 1003 events. 337/1003 cut-off events. For 3802/3954 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7251 event pairs, 57 based on Foata normal form. 27/967 useless extension candidates. Maximal degree in co-relation 3007. Up to 207 conditions per place. [2021-03-11 02:15:40,556 INFO L132 encePairwiseOnDemand]: 91/100 looper letters, 19 selfloop transitions, 16 changer transitions 0/123 dead transitions. [2021-03-11 02:15:40,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 123 transitions, 559 flow [2021-03-11 02:15:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:15:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:15:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 811 transitions. [2021-03-11 02:15:40,558 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9011111111111111 [2021-03-11 02:15:40,558 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 811 transitions. [2021-03-11 02:15:40,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 811 transitions. [2021-03-11 02:15:40,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:40,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 811 transitions. [2021-03-11 02:15:40,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.11111111111111) internal successors, (811), 9 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,561 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,561 INFO L185 Difference]: Start difference. First operand has 131 places, 98 transitions, 439 flow. Second operand 9 states and 811 transitions. [2021-03-11 02:15:40,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 123 transitions, 559 flow [2021-03-11 02:15:40,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 123 transitions, 490 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-11 02:15:40,567 INFO L241 Difference]: Finished difference. Result has 122 places, 112 transitions, 481 flow [2021-03-11 02:15:40,567 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=481, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2021-03-11 02:15:40,567 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 17 predicate places. [2021-03-11 02:15:40,567 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 481 flow [2021-03-11 02:15:40,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,567 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:40,567 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:40,567 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 02:15:40,568 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:40,568 INFO L82 PathProgramCache]: Analyzing trace with hash 205076641, now seen corresponding path program 1 times [2021-03-11 02:15:40,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:40,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413241531] [2021-03-11 02:15:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:40,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:40,627 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-11 02:15:40,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-11 02:15:40,635 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-11 02:15:40,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:40,645 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-11 02:15:40,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:40,657 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-11 02:15:40,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:40,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 02:15:40,667 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:40,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:40,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:40,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:40,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:40,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:40,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-03-11 02:15:40,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413241531] [2021-03-11 02:15:40,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:40,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-11 02:15:40,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908252800] [2021-03-11 02:15:40,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 02:15:40,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:40,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 02:15:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-11 02:15:40,703 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 100 [2021-03-11 02:15:40,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 481 flow. Second operand has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:40,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:40,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 100 [2021-03-11 02:15:40,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:41,183 INFO L129 PetriNetUnfolder]: 681/2254 cut-off events. [2021-03-11 02:15:41,183 INFO L130 PetriNetUnfolder]: For 9205/9425 co-relation queries the response was YES. [2021-03-11 02:15:41,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7791 conditions, 2254 events. 681/2254 cut-off events. For 9205/9425 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21386 event pairs, 114 based on Foata normal form. 74/2189 useless extension candidates. Maximal degree in co-relation 7717. Up to 477 conditions per place. [2021-03-11 02:15:41,203 INFO L132 encePairwiseOnDemand]: 89/100 looper letters, 46 selfloop transitions, 39 changer transitions 12/179 dead transitions. [2021-03-11 02:15:41,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 179 transitions, 1363 flow [2021-03-11 02:15:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:15:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:15:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1072 transitions. [2021-03-11 02:15:41,206 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8246153846153846 [2021-03-11 02:15:41,206 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1072 transitions. [2021-03-11 02:15:41,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1072 transitions. [2021-03-11 02:15:41,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:41,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1072 transitions. [2021-03-11 02:15:41,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 82.46153846153847) internal successors, (1072), 13 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:41,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 100.0) internal successors, (1400), 14 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:41,218 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 100.0) internal successors, (1400), 14 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:41,218 INFO L185 Difference]: Start difference. First operand has 122 places, 112 transitions, 481 flow. Second operand 13 states and 1072 transitions. [2021-03-11 02:15:41,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 179 transitions, 1363 flow [2021-03-11 02:15:41,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 179 transitions, 1361 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 02:15:41,229 INFO L241 Difference]: Finished difference. Result has 138 places, 147 transitions, 969 flow [2021-03-11 02:15:41,230 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=969, PETRI_PLACES=138, PETRI_TRANSITIONS=147} [2021-03-11 02:15:41,230 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 33 predicate places. [2021-03-11 02:15:41,230 INFO L480 AbstractCegarLoop]: Abstraction has has 138 places, 147 transitions, 969 flow [2021-03-11 02:15:41,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:41,231 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:41,231 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:41,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 02:15:41,231 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1552795279, now seen corresponding path program 2 times [2021-03-11 02:15:41,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:41,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322246066] [2021-03-11 02:15:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:41,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:41,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:41,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:41,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:41,284 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-11 02:15:41,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:41,294 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-11 02:15:41,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:41,304 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-11 02:15:41,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:41,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:41,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 02:15:41,314 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:41,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:41,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:41,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:41,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:41,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:41,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:41,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:41,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322246066] [2021-03-11 02:15:41,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:41,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-11 02:15:41,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958350032] [2021-03-11 02:15:41,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 02:15:41,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 02:15:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-11 02:15:41,350 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 100 [2021-03-11 02:15:41,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 147 transitions, 969 flow. Second operand has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:41,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:41,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 100 [2021-03-11 02:15:41,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:42,037 INFO L129 PetriNetUnfolder]: 933/3123 cut-off events. [2021-03-11 02:15:42,038 INFO L130 PetriNetUnfolder]: For 21998/22884 co-relation queries the response was YES. [2021-03-11 02:15:42,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13276 conditions, 3123 events. 933/3123 cut-off events. For 21998/22884 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 31910 event pairs, 107 based on Foata normal form. 111/3068 useless extension candidates. Maximal degree in co-relation 13197. Up to 550 conditions per place. [2021-03-11 02:15:42,067 INFO L132 encePairwiseOnDemand]: 89/100 looper letters, 87 selfloop transitions, 38 changer transitions 4/211 dead transitions. [2021-03-11 02:15:42,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 2071 flow [2021-03-11 02:15:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:15:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:15:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1074 transitions. [2021-03-11 02:15:42,069 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8261538461538461 [2021-03-11 02:15:42,069 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1074 transitions. [2021-03-11 02:15:42,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1074 transitions. [2021-03-11 02:15:42,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:42,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1074 transitions. [2021-03-11 02:15:42,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 82.61538461538461) internal successors, (1074), 13 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 100.0) internal successors, (1400), 14 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,074 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 100.0) internal successors, (1400), 14 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,074 INFO L185 Difference]: Start difference. First operand has 138 places, 147 transitions, 969 flow. Second operand 13 states and 1074 transitions. [2021-03-11 02:15:42,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 2071 flow [2021-03-11 02:15:42,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 211 transitions, 1893 flow, removed 89 selfloop flow, removed 0 redundant places. [2021-03-11 02:15:42,105 INFO L241 Difference]: Finished difference. Result has 158 places, 171 transitions, 1208 flow [2021-03-11 02:15:42,106 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1208, PETRI_PLACES=158, PETRI_TRANSITIONS=171} [2021-03-11 02:15:42,106 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 53 predicate places. [2021-03-11 02:15:42,106 INFO L480 AbstractCegarLoop]: Abstraction has has 158 places, 171 transitions, 1208 flow [2021-03-11 02:15:42,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 78.6) internal successors, (786), 10 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,106 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:42,106 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:42,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 02:15:42,107 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash -904007347, now seen corresponding path program 3 times [2021-03-11 02:15:42,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:42,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5222875] [2021-03-11 02:15:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:42,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:42,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:42,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:42,157 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:15:42,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:42,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:15:42,208 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:15:42,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:42,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:42,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5222875] [2021-03-11 02:15:42,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:42,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:15:42,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782542946] [2021-03-11 02:15:42,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:15:42,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:15:42,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:15:42,218 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 100 [2021-03-11 02:15:42,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 171 transitions, 1208 flow. Second operand has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:42,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 100 [2021-03-11 02:15:42,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:42,614 INFO L129 PetriNetUnfolder]: 908/2920 cut-off events. [2021-03-11 02:15:42,615 INFO L130 PetriNetUnfolder]: For 10454/12980 co-relation queries the response was YES. [2021-03-11 02:15:42,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10317 conditions, 2920 events. 908/2920 cut-off events. For 10454/12980 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 29973 event pairs, 46 based on Foata normal form. 574/3295 useless extension candidates. Maximal degree in co-relation 10232. Up to 823 conditions per place. [2021-03-11 02:15:42,641 INFO L132 encePairwiseOnDemand]: 91/100 looper letters, 15 selfloop transitions, 31 changer transitions 21/191 dead transitions. [2021-03-11 02:15:42,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 191 transitions, 1421 flow [2021-03-11 02:15:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-11 02:15:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-11 02:15:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1082 transitions. [2021-03-11 02:15:42,644 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9016666666666666 [2021-03-11 02:15:42,644 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1082 transitions. [2021-03-11 02:15:42,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1082 transitions. [2021-03-11 02:15:42,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:42,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1082 transitions. [2021-03-11 02:15:42,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.16666666666667) internal successors, (1082), 12 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 100.0) internal successors, (1300), 13 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,647 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 100.0) internal successors, (1300), 13 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,647 INFO L185 Difference]: Start difference. First operand has 158 places, 171 transitions, 1208 flow. Second operand 12 states and 1082 transitions. [2021-03-11 02:15:42,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 191 transitions, 1421 flow [2021-03-11 02:15:42,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 191 transitions, 1390 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-11 02:15:42,663 INFO L241 Difference]: Finished difference. Result has 169 places, 167 transitions, 1161 flow [2021-03-11 02:15:42,664 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1161, PETRI_PLACES=169, PETRI_TRANSITIONS=167} [2021-03-11 02:15:42,664 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 64 predicate places. [2021-03-11 02:15:42,664 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 1161 flow [2021-03-11 02:15:42,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 87.14285714285714) internal successors, (610), 7 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,664 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:42,664 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:42,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 02:15:42,664 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:42,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1813103190, now seen corresponding path program 1 times [2021-03-11 02:15:42,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:42,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352143187] [2021-03-11 02:15:42,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:42,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:42,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:42,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:42,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:42,717 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:15:42,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:15:42,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:15:42,733 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:15:42,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:42,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:42,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:42,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352143187] [2021-03-11 02:15:42,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:42,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 02:15:42,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264051192] [2021-03-11 02:15:42,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 02:15:42,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 02:15:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 02:15:42,743 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 100 [2021-03-11 02:15:42,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 1161 flow. Second operand has 8 states, 8 states have (on average 87.125) internal successors, (697), 8 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:42,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:42,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 100 [2021-03-11 02:15:42,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:43,120 INFO L129 PetriNetUnfolder]: 721/2515 cut-off events. [2021-03-11 02:15:43,121 INFO L130 PetriNetUnfolder]: For 12274/18948 co-relation queries the response was YES. [2021-03-11 02:15:43,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 2515 events. 721/2515 cut-off events. For 12274/18948 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 26556 event pairs, 2 based on Foata normal form. 678/3002 useless extension candidates. Maximal degree in co-relation 9391. Up to 713 conditions per place. [2021-03-11 02:15:43,142 INFO L132 encePairwiseOnDemand]: 91/100 looper letters, 10 selfloop transitions, 36 changer transitions 16/186 dead transitions. [2021-03-11 02:15:43,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 186 transitions, 1415 flow [2021-03-11 02:15:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-11 02:15:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-11 02:15:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1341 transitions. [2021-03-11 02:15:43,145 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.894 [2021-03-11 02:15:43,145 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1341 transitions. [2021-03-11 02:15:43,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1341 transitions. [2021-03-11 02:15:43,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:43,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1341 transitions. [2021-03-11 02:15:43,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.4) internal successors, (1341), 15 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 100.0) internal successors, (1600), 16 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,149 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 100.0) internal successors, (1600), 16 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,149 INFO L185 Difference]: Start difference. First operand has 169 places, 167 transitions, 1161 flow. Second operand 15 states and 1341 transitions. [2021-03-11 02:15:43,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 186 transitions, 1415 flow [2021-03-11 02:15:43,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 186 transitions, 1215 flow, removed 84 selfloop flow, removed 14 redundant places. [2021-03-11 02:15:43,212 INFO L241 Difference]: Finished difference. Result has 163 places, 167 transitions, 1105 flow [2021-03-11 02:15:43,212 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1105, PETRI_PLACES=163, PETRI_TRANSITIONS=167} [2021-03-11 02:15:43,213 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 58 predicate places. [2021-03-11 02:15:43,213 INFO L480 AbstractCegarLoop]: Abstraction has has 163 places, 167 transitions, 1105 flow [2021-03-11 02:15:43,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 87.125) internal successors, (697), 8 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,213 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:43,213 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:43,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 02:15:43,213 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -16973664, now seen corresponding path program 1 times [2021-03-11 02:15:43,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:43,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447352630] [2021-03-11 02:15:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:15:43,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:43,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:43,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:43,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:43,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:43,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:15:43,266 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:15:43,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:15:43,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:43,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:43,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:43,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:15:43,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:15:43,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:15:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:15:43,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447352630] [2021-03-11 02:15:43,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:15:43,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:15:43,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545284941] [2021-03-11 02:15:43,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:15:43,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:15:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:15:43,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:15:43,294 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 100 [2021-03-11 02:15:43,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 167 transitions, 1105 flow. Second operand has 7 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:15:43,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 100 [2021-03-11 02:15:43,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:15:43,636 INFO L129 PetriNetUnfolder]: 1004/3977 cut-off events. [2021-03-11 02:15:43,636 INFO L130 PetriNetUnfolder]: For 10615/11021 co-relation queries the response was YES. [2021-03-11 02:15:43,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 3977 events. 1004/3977 cut-off events. For 10615/11021 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 48702 event pairs, 6 based on Foata normal form. 16/3761 useless extension candidates. Maximal degree in co-relation 12089. Up to 481 conditions per place. [2021-03-11 02:15:43,662 INFO L132 encePairwiseOnDemand]: 94/100 looper letters, 9 selfloop transitions, 2 changer transitions 48/172 dead transitions. [2021-03-11 02:15:43,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 172 transitions, 1149 flow [2021-03-11 02:15:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:15:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:15:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2021-03-11 02:15:43,663 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8828571428571429 [2021-03-11 02:15:43,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2021-03-11 02:15:43,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2021-03-11 02:15:43,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:15:43,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2021-03-11 02:15:43,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,665 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,665 INFO L185 Difference]: Start difference. First operand has 163 places, 167 transitions, 1105 flow. Second operand 7 states and 618 transitions. [2021-03-11 02:15:43,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 172 transitions, 1149 flow [2021-03-11 02:15:43,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 172 transitions, 1044 flow, removed 28 selfloop flow, removed 17 redundant places. [2021-03-11 02:15:43,792 INFO L241 Difference]: Finished difference. Result has 155 places, 124 transitions, 607 flow [2021-03-11 02:15:43,792 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=607, PETRI_PLACES=155, PETRI_TRANSITIONS=124} [2021-03-11 02:15:43,792 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 50 predicate places. [2021-03-11 02:15:43,792 INFO L480 AbstractCegarLoop]: Abstraction has has 155 places, 124 transitions, 607 flow [2021-03-11 02:15:43,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:15:43,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:15:43,793 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:15:43,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 02:15:43,793 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:15:43,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:15:43,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1601012714, now seen corresponding path program 2 times [2021-03-11 02:15:43,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:15:43,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180545302] [2021-03-11 02:15:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:15:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:15:43,833 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:15:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:15:43,863 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:15:43,894 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 02:15:43,894 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 02:15:43,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 02:15:43,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:15:43 BasicIcfg [2021-03-11 02:15:43,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 02:15:43,988 INFO L168 Benchmark]: Toolchain (without parser) took 8240.13 ms. Allocated memory was 255.9 MB in the beginning and 530.6 MB in the end (delta: 274.7 MB). Free memory was 234.6 MB in the beginning and 264.9 MB in the end (delta: -30.3 MB). Peak memory consumption was 242.9 MB. Max. memory is 16.0 GB. [2021-03-11 02:15:43,988 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 02:15:43,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.87 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.0 MB in the beginning and 314.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 02:15:43,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.11 ms. Allocated memory is still 354.4 MB. Free memory was 314.0 MB in the beginning and 310.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 02:15:43,988 INFO L168 Benchmark]: Boogie Preprocessor took 20.49 ms. Allocated memory is still 354.4 MB. Free memory was 310.5 MB in the beginning and 308.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 02:15:43,988 INFO L168 Benchmark]: RCFGBuilder took 1358.57 ms. Allocated memory is still 354.4 MB. Free memory was 308.4 MB in the beginning and 209.6 MB in the end (delta: 98.9 MB). Peak memory consumption was 101.3 MB. Max. memory is 16.0 GB. [2021-03-11 02:15:43,989 INFO L168 Benchmark]: TraceAbstraction took 6424.25 ms. Allocated memory was 354.4 MB in the beginning and 530.6 MB in the end (delta: 176.2 MB). Free memory was 209.6 MB in the beginning and 264.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 119.8 MB. Max. memory is 16.0 GB. [2021-03-11 02:15:43,989 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 400.87 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.0 MB in the beginning and 314.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 30.11 ms. Allocated memory is still 354.4 MB. Free memory was 314.0 MB in the beginning and 310.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.49 ms. Allocated memory is still 354.4 MB. Free memory was 310.5 MB in the beginning and 308.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1358.57 ms. Allocated memory is still 354.4 MB. Free memory was 308.4 MB in the beginning and 209.6 MB in the end (delta: 98.9 MB). Peak memory consumption was 101.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6424.25 ms. Allocated memory was 354.4 MB in the beginning and 530.6 MB in the end (delta: 176.2 MB). Free memory was 209.6 MB in the beginning and 264.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 119.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L726] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L727] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L728] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L729] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t515; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6247.9ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4365.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 54.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 134 SDtfs, 341 SDslu, 479 SDs, 0 SdLazy, 1036 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 804.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1384.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1208occurred in iteration=8, InterpolantAutomatonStates: 125, 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: 36.1ms SsaConstructionTime, 360.8ms SatisfiabilityAnalysisTime, 1204.5ms InterpolantComputationTime, 793 NumberOfCodeBlocks, 793 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 3131 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...