/usr/bin/java -Xmx8000000000 -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/safe001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-13 07:27:41,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-13 07:27:41,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-13 07:27:41,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-13 07:27:41,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-13 07:27:41,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-13 07:27:41,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-13 07:27:41,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-13 07:27:41,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-13 07:27:41,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-13 07:27:41,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-13 07:27:41,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-13 07:27:41,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-13 07:27:41,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-13 07:27:41,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-13 07:27:41,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-13 07:27:41,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-13 07:27:41,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-13 07:27:41,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-13 07:27:41,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-13 07:27:41,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-13 07:27:41,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-13 07:27:41,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-13 07:27:41,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-13 07:27:41,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-13 07:27:41,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-13 07:27:41,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-13 07:27:42,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-13 07:27:42,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-13 07:27:42,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-13 07:27:42,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-13 07:27:42,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-13 07:27:42,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-13 07:27:42,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-13 07:27:42,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-13 07:27:42,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-13 07:27:42,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-13 07:27:42,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-13 07:27:42,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-13 07:27:42,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-13 07:27:42,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-13 07:27:42,006 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-06-13 07:27:42,033 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-13 07:27:42,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-13 07:27:42,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-13 07:27:42,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-13 07:27:42,035 INFO L138 SettingsManager]: * Use SBE=true [2021-06-13 07:27:42,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-13 07:27:42,035 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-13 07:27:42,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-13 07:27:42,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-13 07:27:42,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-13 07:27:42,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-13 07:27:42,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-13 07:27:42,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-13 07:27:42,037 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-13 07:27:42,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-13 07:27:42,053 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-13 07:27:42,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-13 07:27:42,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:27:42,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-13 07:27:42,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-13 07:27:42,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-13 07:27:42,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-13 07:27:42,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-13 07:27:42,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-13 07:27:42,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-13 07:27:42,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-13 07:27:42,301 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-13 07:27:42,302 INFO L275 PluginConnector]: CDTParser initialized [2021-06-13 07:27:42,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2021-06-13 07:27:42,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55b7b8b5/724d556ba42d481a9390732ad5fac8b1/FLAGc92b5fb3c [2021-06-13 07:27:42,796 INFO L306 CDTParser]: Found 1 translation units. [2021-06-13 07:27:42,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2021-06-13 07:27:42,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55b7b8b5/724d556ba42d481a9390732ad5fac8b1/FLAGc92b5fb3c [2021-06-13 07:27:42,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55b7b8b5/724d556ba42d481a9390732ad5fac8b1 [2021-06-13 07:27:42,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-13 07:27:42,830 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-13 07:27:42,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-13 07:27:42,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-13 07:27:42,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-13 07:27:42,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:27:42" (1/1) ... [2021-06-13 07:27:42,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d6b527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:42, skipping insertion in model container [2021-06-13 07:27:42,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:27:42" (1/1) ... [2021-06-13 07:27:42,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-13 07:27:42,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-13 07:27:43,031 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i[949,962] [2021-06-13 07:27:43,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:27:43,201 INFO L203 MainTranslator]: Completed pre-run [2021-06-13 07:27:43,209 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i[949,962] [2021-06-13 07:27:43,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:27:43,278 INFO L208 MainTranslator]: Completed translation [2021-06-13 07:27:43,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43 WrapperNode [2021-06-13 07:27:43,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-13 07:27:43,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-13 07:27:43,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-13 07:27:43,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-13 07:27:43,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-13 07:27:43,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-13 07:27:43,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-13 07:27:43,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-13 07:27:43,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... [2021-06-13 07:27:43,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-13 07:27:43,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-13 07:27:43,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-13 07:27:43,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-13 07:27:43,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-13 07:27:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-13 07:27:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-13 07:27:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-13 07:27:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-13 07:27:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-13 07:27:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-13 07:27:43,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-13 07:27:43,395 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-13 07:27:44,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-13 07:27:44,715 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-13 07:27:44,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:27:44 BoogieIcfgContainer [2021-06-13 07:27:44,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-13 07:27:44,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-13 07:27:44,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-13 07:27:44,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-13 07:27:44,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.06 07:27:42" (1/3) ... [2021-06-13 07:27:44,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c1c2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:27:44, skipping insertion in model container [2021-06-13 07:27:44,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:27:43" (2/3) ... [2021-06-13 07:27:44,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c1c2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:27:44, skipping insertion in model container [2021-06-13 07:27:44,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:27:44" (3/3) ... [2021-06-13 07:27:44,721 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.opt.i [2021-06-13 07:27:44,730 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-13 07:27:44,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-13 07:27:44,730 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:27:44,765 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-13 07:27:44,779 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:27:44,791 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:27:44,792 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:27:44,792 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:27:44,792 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:27:44,792 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:27:44,792 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:27:44,792 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:27:44,792 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-13 07:27:44,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-06-13 07:27:44,819 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-06-13 07:27:44,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:44,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:27:44,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-06-13 07:27:44,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2021-06-13 07:27:44,823 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-13 07:27:44,823 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:44,824 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-13 07:27:44,825 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:27:44,827 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:27:44,827 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:27:44,827 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:27:44,827 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:27:44,827 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:27:44,827 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:27:44,827 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:27:44,827 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork1======== [2021-06-13 07:27:44,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-06-13 07:27:44,851 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-06-13 07:27:44,851 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:44,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:27:44,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-06-13 07:27:44,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-06-13 07:27:44,860 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-06-13 07:27:44,860 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:44,860 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:44,860 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] [2021-06-13 07:27:44,860 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash -591144752, now seen corresponding path program 1 times [2021-06-13 07:27:44,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:44,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714912399] [2021-06-13 07:27:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:45,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:45,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:45,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714912399] [2021-06-13 07:27:45,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714912399] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:45,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:45,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 07:27:45,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731809173] [2021-06-13 07:27:45,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 07:27:45,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:45,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 07:27:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 07:27:45,096 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 106 [2021-06-13 07:27:45,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:45,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 106 [2021-06-13 07:27:45,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:45,169 INFO L129 PetriNetUnfolder]: 49/388 cut-off events. [2021-06-13 07:27:45,170 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:45,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 388 events. 49/388 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1943 event pairs, 27 based on Foata normal form. 18/382 useless extension candidates. Maximal degree in co-relation 437. Up to 65 conditions per place. [2021-06-13 07:27:45,172 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 0 selfloop transitions, 0 changer transitions 103/103 dead transitions. [2021-06-13 07:27:45,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 237 flow [2021-06-13 07:27:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 07:27:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-13 07:27:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2021-06-13 07:27:45,180 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2021-06-13 07:27:45,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2021-06-13 07:27:45,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2021-06-13 07:27:45,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:45,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2021-06-13 07:27:45,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,191 INFO L185 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 301 transitions. [2021-06-13 07:27:45,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 103 transitions, 237 flow [2021-06-13 07:27:45,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:27:45,194 INFO L241 Difference]: Finished difference. Result has 108 places, 0 transitions, 0 flow [2021-06-13 07:27:45,195 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=108, PETRI_TRANSITIONS=0} [2021-06-13 07:27:45,196 INFO L335 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2021-06-13 07:27:45,196 INFO L482 AbstractCegarLoop]: Abstraction has has 108 places, 0 transitions, 0 flow [2021-06-13 07:27:45,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-13 07:27:45,197 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork1 was SAFE (2/3) [2021-06-13 07:27:45,197 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-13 07:27:45,198 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:27:45,198 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:27:45,198 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:27:45,198 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:27:45,198 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:27:45,199 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:27:45,199 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:27:45,199 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-13 07:27:45,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-06-13 07:27:45,206 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-06-13 07:27:45,207 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:45,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:27:45,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-06-13 07:27:45,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 91 transitions, 191 flow [2021-06-13 07:27:45,213 INFO L129 PetriNetUnfolder]: 1/90 cut-off events. [2021-06-13 07:27:45,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:45,213 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:45,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] [2021-06-13 07:27:45,213 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-06-13 07:27:45,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:45,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223876639] [2021-06-13 07:27:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:45,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:45,330 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:45,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:45,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:45,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:45,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:45,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:45,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223876639] [2021-06-13 07:27:45,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223876639] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:45,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:45,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:27:45,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692665840] [2021-06-13 07:27:45,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:27:45,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:27:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:27:45,357 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 106 [2021-06-13 07:27:45,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:45,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 106 [2021-06-13 07:27:45,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:45,492 INFO L129 PetriNetUnfolder]: 131/403 cut-off events. [2021-06-13 07:27:45,493 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:27:45,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 403 events. 131/403 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1899 event pairs, 21 based on Foata normal form. 15/403 useless extension candidates. Maximal degree in co-relation 598. Up to 108 conditions per place. [2021-06-13 07:27:45,495 INFO L132 encePairwiseOnDemand]: 98/106 looper letters, 12 selfloop transitions, 3 changer transitions 31/125 dead transitions. [2021-06-13 07:27:45,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 125 transitions, 351 flow [2021-06-13 07:27:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:27:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:27:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-06-13 07:27:45,498 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-06-13 07:27:45,498 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-06-13 07:27:45,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-06-13 07:27:45,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:45,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-06-13 07:27:45,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,503 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,503 INFO L185 Difference]: Start difference. First operand has 100 places, 91 transitions, 191 flow. Second operand 9 states and 869 transitions. [2021-06-13 07:27:45,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 125 transitions, 351 flow [2021-06-13 07:27:45,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:27:45,506 INFO L241 Difference]: Finished difference. Result has 112 places, 92 transitions, 229 flow [2021-06-13 07:27:45,506 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2021-06-13 07:27:45,506 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2021-06-13 07:27:45,506 INFO L482 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 229 flow [2021-06-13 07:27:45,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,507 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:45,507 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] [2021-06-13 07:27:45,507 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-13 07:27:45,507 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash -790812144, now seen corresponding path program 1 times [2021-06-13 07:27:45,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:45,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748810849] [2021-06-13 07:27:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:45,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:45,581 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:45,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:45,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:45,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:45,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:45,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:45,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748810849] [2021-06-13 07:27:45,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748810849] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:45,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:45,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:27:45,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007367645] [2021-06-13 07:27:45,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:27:45,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:45,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:27:45,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:27:45,606 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-06-13 07:27:45,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:45,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-06-13 07:27:45,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:45,723 INFO L129 PetriNetUnfolder]: 14/149 cut-off events. [2021-06-13 07:27:45,724 INFO L130 PetriNetUnfolder]: For 117/119 co-relation queries the response was YES. [2021-06-13 07:27:45,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 149 events. 14/149 cut-off events. For 117/119 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 305 event pairs, 5 based on Foata normal form. 3/148 useless extension candidates. Maximal degree in co-relation 256. Up to 21 conditions per place. [2021-06-13 07:27:45,724 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 10/102 dead transitions. [2021-06-13 07:27:45,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 102 transitions, 303 flow [2021-06-13 07:27:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:27:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:27:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 866 transitions. [2021-06-13 07:27:45,726 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9077568134171907 [2021-06-13 07:27:45,727 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 866 transitions. [2021-06-13 07:27:45,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 866 transitions. [2021-06-13 07:27:45,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:45,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 866 transitions. [2021-06-13 07:27:45,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,730 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,730 INFO L185 Difference]: Start difference. First operand has 112 places, 92 transitions, 229 flow. Second operand 9 states and 866 transitions. [2021-06-13 07:27:45,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 102 transitions, 303 flow [2021-06-13 07:27:45,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 286 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-06-13 07:27:45,735 INFO L241 Difference]: Finished difference. Result has 117 places, 92 transitions, 240 flow [2021-06-13 07:27:45,735 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=117, PETRI_TRANSITIONS=92} [2021-06-13 07:27:45,736 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2021-06-13 07:27:45,736 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 92 transitions, 240 flow [2021-06-13 07:27:45,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:45,736 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] [2021-06-13 07:27:45,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-13 07:27:45,736 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1997772786, now seen corresponding path program 1 times [2021-06-13 07:27:45,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:45,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832327709] [2021-06-13 07:27:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:45,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:45,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:45,860 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:45,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:45,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:45,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:45,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:45,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:45,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:45,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832327709] [2021-06-13 07:27:45,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832327709] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:45,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:45,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:27:45,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669890372] [2021-06-13 07:27:45,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:27:45,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:27:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:27:45,893 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-06-13 07:27:45,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 92 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:45,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:45,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-06-13 07:27:45,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:46,002 INFO L129 PetriNetUnfolder]: 57/245 cut-off events. [2021-06-13 07:27:46,005 INFO L130 PetriNetUnfolder]: For 351/525 co-relation queries the response was YES. [2021-06-13 07:27:46,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 245 events. 57/245 cut-off events. For 351/525 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 845 event pairs, 11 based on Foata normal form. 7/239 useless extension candidates. Maximal degree in co-relation 566. Up to 49 conditions per place. [2021-06-13 07:27:46,006 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 10 selfloop transitions, 4 changer transitions 18/109 dead transitions. [2021-06-13 07:27:46,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 411 flow [2021-06-13 07:27:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-13 07:27:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-13 07:27:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2021-06-13 07:27:46,008 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8921832884097035 [2021-06-13 07:27:46,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2021-06-13 07:27:46,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2021-06-13 07:27:46,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:46,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2021-06-13 07:27:46,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,011 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,011 INFO L185 Difference]: Start difference. First operand has 117 places, 92 transitions, 240 flow. Second operand 7 states and 662 transitions. [2021-06-13 07:27:46,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 411 flow [2021-06-13 07:27:46,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 377 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-13 07:27:46,016 INFO L241 Difference]: Finished difference. Result has 113 places, 89 transitions, 228 flow [2021-06-13 07:27:46,016 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=113, PETRI_TRANSITIONS=89} [2021-06-13 07:27:46,016 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 13 predicate places. [2021-06-13 07:27:46,016 INFO L482 AbstractCegarLoop]: Abstraction has has 113 places, 89 transitions, 228 flow [2021-06-13 07:27:46,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,016 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:46,017 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] [2021-06-13 07:27:46,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-13 07:27:46,017 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -336762767, now seen corresponding path program 1 times [2021-06-13 07:27:46,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:46,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20365695] [2021-06-13 07:27:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:46,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:46,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:46,129 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:46,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:46,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:46,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:46,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:46,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:46,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20365695] [2021-06-13 07:27:46,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20365695] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:46,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:46,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:27:46,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096538929] [2021-06-13 07:27:46,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:27:46,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:27:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:27:46,161 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-06-13 07:27:46,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 89 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:46,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-06-13 07:27:46,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:46,238 INFO L129 PetriNetUnfolder]: 15/151 cut-off events. [2021-06-13 07:27:46,238 INFO L130 PetriNetUnfolder]: For 126/130 co-relation queries the response was YES. [2021-06-13 07:27:46,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 151 events. 15/151 cut-off events. For 126/130 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 327 event pairs, 9 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 267. Up to 18 conditions per place. [2021-06-13 07:27:46,239 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 11/99 dead transitions. [2021-06-13 07:27:46,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 99 transitions, 306 flow [2021-06-13 07:27:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:27:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:27:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 866 transitions. [2021-06-13 07:27:46,241 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9077568134171907 [2021-06-13 07:27:46,241 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 866 transitions. [2021-06-13 07:27:46,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 866 transitions. [2021-06-13 07:27:46,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:46,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 866 transitions. [2021-06-13 07:27:46,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,244 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,244 INFO L185 Difference]: Start difference. First operand has 113 places, 89 transitions, 228 flow. Second operand 9 states and 866 transitions. [2021-06-13 07:27:46,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 99 transitions, 306 flow [2021-06-13 07:27:46,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 99 transitions, 278 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-06-13 07:27:46,246 INFO L241 Difference]: Finished difference. Result has 117 places, 88 transitions, 228 flow [2021-06-13 07:27:46,246 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=117, PETRI_TRANSITIONS=88} [2021-06-13 07:27:46,246 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2021-06-13 07:27:46,246 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 88 transitions, 228 flow [2021-06-13 07:27:46,246 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,246 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:46,246 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] [2021-06-13 07:27:46,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-13 07:27:46,247 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1412987058, now seen corresponding path program 1 times [2021-06-13 07:27:46,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:46,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436579589] [2021-06-13 07:27:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:46,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:46,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:46,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:46,339 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:46,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:46,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:46,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:46,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:46,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:46,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436579589] [2021-06-13 07:27:46,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436579589] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:46,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:46,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:27:46,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737225290] [2021-06-13 07:27:46,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:27:46,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:27:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:27:46,372 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-06-13 07:27:46,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 88 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:46,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-06-13 07:27:46,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:46,572 INFO L129 PetriNetUnfolder]: 9/154 cut-off events. [2021-06-13 07:27:46,572 INFO L130 PetriNetUnfolder]: For 167/241 co-relation queries the response was YES. [2021-06-13 07:27:46,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 154 events. 9/154 cut-off events. For 167/241 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 357 event pairs, 1 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 303. Up to 18 conditions per place. [2021-06-13 07:27:46,573 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 10 selfloop transitions, 2 changer transitions 24/112 dead transitions. [2021-06-13 07:27:46,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 112 transitions, 475 flow [2021-06-13 07:27:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-13 07:27:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-06-13 07:27:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1570 transitions. [2021-06-13 07:27:46,576 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8712541620421753 [2021-06-13 07:27:46,576 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1570 transitions. [2021-06-13 07:27:46,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1570 transitions. [2021-06-13 07:27:46,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:46,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1570 transitions. [2021-06-13 07:27:46,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 92.3529411764706) internal successors, (1570), 17 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,582 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,582 INFO L185 Difference]: Start difference. First operand has 117 places, 88 transitions, 228 flow. Second operand 17 states and 1570 transitions. [2021-06-13 07:27:46,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 112 transitions, 475 flow [2021-06-13 07:27:46,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 409 flow, removed 30 selfloop flow, removed 8 redundant places. [2021-06-13 07:27:46,587 INFO L241 Difference]: Finished difference. Result has 133 places, 88 transitions, 248 flow [2021-06-13 07:27:46,587 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=248, PETRI_PLACES=133, PETRI_TRANSITIONS=88} [2021-06-13 07:27:46,587 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 33 predicate places. [2021-06-13 07:27:46,587 INFO L482 AbstractCegarLoop]: Abstraction has has 133 places, 88 transitions, 248 flow [2021-06-13 07:27:46,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,588 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:46,588 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] [2021-06-13 07:27:46,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-13 07:27:46,588 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:46,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:46,588 INFO L82 PathProgramCache]: Analyzing trace with hash -320032451, now seen corresponding path program 1 times [2021-06-13 07:27:46,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:46,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594237594] [2021-06-13 07:27:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:46,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:46,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:46,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:27:46,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:27:46,696 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-13 07:27:46,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-13 07:27:46,723 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.2 percent of original size [2021-06-13 07:27:46,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-06-13 07:27:46,733 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:46,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:46,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:46,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:46,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:46,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:46,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:46,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594237594] [2021-06-13 07:27:46,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594237594] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:46,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:46,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-13 07:27:46,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329438222] [2021-06-13 07:27:46,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-13 07:27:46,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-13 07:27:46,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-13 07:27:46,768 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2021-06-13 07:27:46,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 88 transitions, 248 flow. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:46,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:46,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2021-06-13 07:27:46,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:46,998 INFO L129 PetriNetUnfolder]: 202/529 cut-off events. [2021-06-13 07:27:46,998 INFO L130 PetriNetUnfolder]: For 1052/1068 co-relation queries the response was YES. [2021-06-13 07:27:47,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 529 events. 202/529 cut-off events. For 1052/1068 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2354 event pairs, 93 based on Foata normal form. 12/518 useless extension candidates. Maximal degree in co-relation 1251. Up to 220 conditions per place. [2021-06-13 07:27:47,002 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 14 selfloop transitions, 9 changer transitions 28/123 dead transitions. [2021-06-13 07:27:47,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 123 transitions, 472 flow [2021-06-13 07:27:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-13 07:27:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-13 07:27:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1158 transitions. [2021-06-13 07:27:47,005 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8403483309143687 [2021-06-13 07:27:47,005 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1158 transitions. [2021-06-13 07:27:47,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1158 transitions. [2021-06-13 07:27:47,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:47,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1158 transitions. [2021-06-13 07:27:47,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.07692307692308) internal successors, (1158), 13 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,010 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,010 INFO L185 Difference]: Start difference. First operand has 133 places, 88 transitions, 248 flow. Second operand 13 states and 1158 transitions. [2021-06-13 07:27:47,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 123 transitions, 472 flow [2021-06-13 07:27:47,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 123 transitions, 384 flow, removed 42 selfloop flow, removed 19 redundant places. [2021-06-13 07:27:47,014 INFO L241 Difference]: Finished difference. Result has 120 places, 93 transitions, 273 flow [2021-06-13 07:27:47,014 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=273, PETRI_PLACES=120, PETRI_TRANSITIONS=93} [2021-06-13 07:27:47,014 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places. [2021-06-13 07:27:47,015 INFO L482 AbstractCegarLoop]: Abstraction has has 120 places, 93 transitions, 273 flow [2021-06-13 07:27:47,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,015 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:47,015 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-06-13 07:27:47,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-13 07:27:47,015 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:47,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1197559181, now seen corresponding path program 1 times [2021-06-13 07:27:47,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:47,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055994523] [2021-06-13 07:27:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:47,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:47,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:47,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:47,092 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:47,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:47,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:47,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:47,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:47,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:47,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055994523] [2021-06-13 07:27:47,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055994523] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:47,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:47,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:27:47,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84618045] [2021-06-13 07:27:47,123 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:27:47,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:47,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:27:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:27:47,125 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 106 [2021-06-13 07:27:47,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 93 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:47,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 106 [2021-06-13 07:27:47,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:47,218 INFO L129 PetriNetUnfolder]: 51/280 cut-off events. [2021-06-13 07:27:47,218 INFO L130 PetriNetUnfolder]: For 572/707 co-relation queries the response was YES. [2021-06-13 07:27:47,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 280 events. 51/280 cut-off events. For 572/707 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1207 event pairs, 37 based on Foata normal form. 9/281 useless extension candidates. Maximal degree in co-relation 712. Up to 75 conditions per place. [2021-06-13 07:27:47,220 INFO L132 encePairwiseOnDemand]: 98/106 looper letters, 8 selfloop transitions, 4 changer transitions 7/98 dead transitions. [2021-06-13 07:27:47,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 338 flow [2021-06-13 07:27:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-13 07:27:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-13 07:27:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 648 transitions. [2021-06-13 07:27:47,226 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8733153638814016 [2021-06-13 07:27:47,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 648 transitions. [2021-06-13 07:27:47,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 648 transitions. [2021-06-13 07:27:47,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:47,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 648 transitions. [2021-06-13 07:27:47,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.57142857142857) internal successors, (648), 7 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,229 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 106.0) internal successors, (848), 8 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,229 INFO L185 Difference]: Start difference. First operand has 120 places, 93 transitions, 273 flow. Second operand 7 states and 648 transitions. [2021-06-13 07:27:47,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 338 flow [2021-06-13 07:27:47,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 98 transitions, 316 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-06-13 07:27:47,232 INFO L241 Difference]: Finished difference. Result has 117 places, 91 transitions, 268 flow [2021-06-13 07:27:47,232 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2021-06-13 07:27:47,232 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2021-06-13 07:27:47,232 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 91 transitions, 268 flow [2021-06-13 07:27:47,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:47,233 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-06-13 07:27:47,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-13 07:27:47,233 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 420116401, now seen corresponding path program 2 times [2021-06-13 07:27:47,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:47,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659319804] [2021-06-13 07:27:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:47,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:47,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:47,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:27:47,297 INFO L142 QuantifierPusher]: treesize reduction 35, result has 53.9 percent of original size [2021-06-13 07:27:47,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-13 07:27:47,320 INFO L142 QuantifierPusher]: treesize reduction 51, result has 52.3 percent of original size [2021-06-13 07:27:47,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-06-13 07:27:47,341 INFO L142 QuantifierPusher]: treesize reduction 51, result has 53.6 percent of original size [2021-06-13 07:27:47,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-06-13 07:27:47,363 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:47,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:47,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:47,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:47,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:47,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:47,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659319804] [2021-06-13 07:27:47,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659319804] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:47,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:47,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-13 07:27:47,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283048485] [2021-06-13 07:27:47,399 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-13 07:27:47,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-13 07:27:47,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-13 07:27:47,400 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2021-06-13 07:27:47,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 91 transitions, 268 flow. Second operand has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:47,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2021-06-13 07:27:47,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:47,821 INFO L129 PetriNetUnfolder]: 190/501 cut-off events. [2021-06-13 07:27:47,821 INFO L130 PetriNetUnfolder]: For 1129/1150 co-relation queries the response was YES. [2021-06-13 07:27:47,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 501 events. 190/501 cut-off events. For 1129/1150 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2277 event pairs, 32 based on Foata normal form. 11/507 useless extension candidates. Maximal degree in co-relation 1497. Up to 185 conditions per place. [2021-06-13 07:27:47,826 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 19 selfloop transitions, 9 changer transitions 25/125 dead transitions. [2021-06-13 07:27:47,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 592 flow [2021-06-13 07:27:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-13 07:27:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-13 07:27:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1157 transitions. [2021-06-13 07:27:47,830 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.839622641509434 [2021-06-13 07:27:47,830 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1157 transitions. [2021-06-13 07:27:47,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1157 transitions. [2021-06-13 07:27:47,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:47,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1157 transitions. [2021-06-13 07:27:47,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,834 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,834 INFO L185 Difference]: Start difference. First operand has 117 places, 91 transitions, 268 flow. Second operand 13 states and 1157 transitions. [2021-06-13 07:27:47,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 592 flow [2021-06-13 07:27:47,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 546 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-06-13 07:27:47,837 INFO L241 Difference]: Finished difference. Result has 124 places, 94 transitions, 325 flow [2021-06-13 07:27:47,837 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=325, PETRI_PLACES=124, PETRI_TRANSITIONS=94} [2021-06-13 07:27:47,837 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 24 predicate places. [2021-06-13 07:27:47,837 INFO L482 AbstractCegarLoop]: Abstraction has has 124 places, 94 transitions, 325 flow [2021-06-13 07:27:47,838 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,838 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:47,838 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-06-13 07:27:47,838 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-13 07:27:47,838 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1495800618, now seen corresponding path program 1 times [2021-06-13 07:27:47,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:47,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811542365] [2021-06-13 07:27:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:47,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:47,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:47,895 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:27:47,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:27:47,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:27:47,912 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:27:47,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:47,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:47,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:47,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:47,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811542365] [2021-06-13 07:27:47,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811542365] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:47,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:47,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:27:47,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537356078] [2021-06-13 07:27:47,919 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:27:47,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:27:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:27:47,920 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-06-13 07:27:47,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 94 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:47,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:47,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-06-13 07:27:47,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:48,049 INFO L129 PetriNetUnfolder]: 267/850 cut-off events. [2021-06-13 07:27:48,049 INFO L130 PetriNetUnfolder]: For 1789/1833 co-relation queries the response was YES. [2021-06-13 07:27:48,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 850 events. 267/850 cut-off events. For 1789/1833 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5823 event pairs, 73 based on Foata normal form. 33/831 useless extension candidates. Maximal degree in co-relation 2113. Up to 173 conditions per place. [2021-06-13 07:27:48,056 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 19 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2021-06-13 07:27:48,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 119 transitions, 445 flow [2021-06-13 07:27:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:27:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:27:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 865 transitions. [2021-06-13 07:27:48,058 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9067085953878407 [2021-06-13 07:27:48,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 865 transitions. [2021-06-13 07:27:48,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 865 transitions. [2021-06-13 07:27:48,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:48,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 865 transitions. [2021-06-13 07:27:48,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,061 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,061 INFO L185 Difference]: Start difference. First operand has 124 places, 94 transitions, 325 flow. Second operand 9 states and 865 transitions. [2021-06-13 07:27:48,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 119 transitions, 445 flow [2021-06-13 07:27:48,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 422 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-06-13 07:27:48,064 INFO L241 Difference]: Finished difference. Result has 123 places, 108 transitions, 413 flow [2021-06-13 07:27:48,064 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=413, PETRI_PLACES=123, PETRI_TRANSITIONS=108} [2021-06-13 07:27:48,064 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 23 predicate places. [2021-06-13 07:27:48,064 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 108 transitions, 413 flow [2021-06-13 07:27:48,065 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,065 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:48,065 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, 1] [2021-06-13 07:27:48,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-13 07:27:48,065 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1953983822, now seen corresponding path program 1 times [2021-06-13 07:27:48,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:48,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927549475] [2021-06-13 07:27:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:48,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:48,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:48,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:48,101 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:27:48,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:27:48,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:27:48,119 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:27:48,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:48,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:48,126 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:48,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927549475] [2021-06-13 07:27:48,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927549475] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:48,126 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:48,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:27:48,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4622649] [2021-06-13 07:27:48,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:27:48,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:27:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:27:48,128 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-06-13 07:27:48,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 108 transitions, 413 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:48,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-06-13 07:27:48,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:48,295 INFO L129 PetriNetUnfolder]: 184/707 cut-off events. [2021-06-13 07:27:48,295 INFO L130 PetriNetUnfolder]: For 1408/1815 co-relation queries the response was YES. [2021-06-13 07:27:48,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 707 events. 184/707 cut-off events. For 1408/1815 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4983 event pairs, 6 based on Foata normal form. 130/797 useless extension candidates. Maximal degree in co-relation 1999. Up to 173 conditions per place. [2021-06-13 07:27:48,300 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 31 changer transitions 6/136 dead transitions. [2021-06-13 07:27:48,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 136 transitions, 698 flow [2021-06-13 07:27:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-13 07:27:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-13 07:27:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1154 transitions. [2021-06-13 07:27:48,303 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9072327044025157 [2021-06-13 07:27:48,303 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1154 transitions. [2021-06-13 07:27:48,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1154 transitions. [2021-06-13 07:27:48,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:48,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1154 transitions. [2021-06-13 07:27:48,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.16666666666667) internal successors, (1154), 12 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,332 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,332 INFO L185 Difference]: Start difference. First operand has 123 places, 108 transitions, 413 flow. Second operand 12 states and 1154 transitions. [2021-06-13 07:27:48,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 136 transitions, 698 flow [2021-06-13 07:27:48,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-13 07:27:48,336 INFO L241 Difference]: Finished difference. Result has 136 places, 127 transitions, 641 flow [2021-06-13 07:27:48,337 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=641, PETRI_PLACES=136, PETRI_TRANSITIONS=127} [2021-06-13 07:27:48,337 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 36 predicate places. [2021-06-13 07:27:48,337 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 127 transitions, 641 flow [2021-06-13 07:27:48,337 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:48,337 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, 1, 1, 1] [2021-06-13 07:27:48,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-13 07:27:48,337 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash -605617527, now seen corresponding path program 1 times [2021-06-13 07:27:48,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:48,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295409012] [2021-06-13 07:27:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:48,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:48,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:48,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:48,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:48,382 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:27:48,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:27:48,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:27:48,400 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:27:48,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:48,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:48,407 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:48,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295409012] [2021-06-13 07:27:48,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295409012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:48,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:48,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:27:48,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228282174] [2021-06-13 07:27:48,407 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:27:48,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:48,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:27:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:27:48,408 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-06-13 07:27:48,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 127 transitions, 641 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:48,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-06-13 07:27:48,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:48,615 INFO L129 PetriNetUnfolder]: 148/620 cut-off events. [2021-06-13 07:27:48,616 INFO L130 PetriNetUnfolder]: For 1881/2481 co-relation queries the response was YES. [2021-06-13 07:27:48,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 620 events. 148/620 cut-off events. For 1881/2481 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4523 event pairs, 1 based on Foata normal form. 127/708 useless extension candidates. Maximal degree in co-relation 1994. Up to 151 conditions per place. [2021-06-13 07:27:48,622 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 10 selfloop transitions, 36 changer transitions 16/146 dead transitions. [2021-06-13 07:27:48,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 895 flow [2021-06-13 07:27:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-13 07:27:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-13 07:27:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1431 transitions. [2021-06-13 07:27:48,625 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-06-13 07:27:48,625 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1431 transitions. [2021-06-13 07:27:48,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1431 transitions. [2021-06-13 07:27:48,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:48,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1431 transitions. [2021-06-13 07:27:48,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.4) internal successors, (1431), 15 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,629 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,629 INFO L185 Difference]: Start difference. First operand has 136 places, 127 transitions, 641 flow. Second operand 15 states and 1431 transitions. [2021-06-13 07:27:48,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 895 flow [2021-06-13 07:27:48,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 146 transitions, 717 flow, removed 75 selfloop flow, removed 7 redundant places. [2021-06-13 07:27:48,638 INFO L241 Difference]: Finished difference. Result has 149 places, 127 transitions, 607 flow [2021-06-13 07:27:48,639 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=607, PETRI_PLACES=149, PETRI_TRANSITIONS=127} [2021-06-13 07:27:48,639 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 49 predicate places. [2021-06-13 07:27:48,639 INFO L482 AbstractCegarLoop]: Abstraction has has 149 places, 127 transitions, 607 flow [2021-06-13 07:27:48,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,639 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:48,639 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, 1, 1, 1, 1, 1, 1] [2021-06-13 07:27:48,639 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-13 07:27:48,639 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash -752117558, now seen corresponding path program 1 times [2021-06-13 07:27:48,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:48,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442001127] [2021-06-13 07:27:48,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:27:48,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:48,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:27:48,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:27:48,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:27:48,762 INFO L142 QuantifierPusher]: treesize reduction 9, result has 76.9 percent of original size [2021-06-13 07:27:48,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-06-13 07:27:48,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-13 07:27:48,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-13 07:27:48,806 INFO L142 QuantifierPusher]: treesize reduction 11, result has 72.5 percent of original size [2021-06-13 07:27:48,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-13 07:27:48,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-13 07:27:48,838 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-06-13 07:27:48,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-13 07:27:48,853 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:27:48,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:27:48,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:48,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:27:48,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:27:48,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:27:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:27:48,884 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:27:48,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442001127] [2021-06-13 07:27:48,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442001127] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:27:48,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:27:48,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-13 07:27:48,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701334126] [2021-06-13 07:27:48,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-13 07:27:48,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:27:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-13 07:27:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-13 07:27:48,886 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-06-13 07:27:48,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 127 transitions, 607 flow. Second operand has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:48,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:27:48,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-06-13 07:27:48,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:27:49,114 INFO L129 PetriNetUnfolder]: 158/709 cut-off events. [2021-06-13 07:27:49,114 INFO L130 PetriNetUnfolder]: For 1460/1510 co-relation queries the response was YES. [2021-06-13 07:27:49,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 709 events. 158/709 cut-off events. For 1460/1510 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5655 event pairs, 0 based on Foata normal form. 4/680 useless extension candidates. Maximal degree in co-relation 1938. Up to 82 conditions per place. [2021-06-13 07:27:49,118 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 22 selfloop transitions, 6 changer transitions 11/139 dead transitions. [2021-06-13 07:27:49,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 139 transitions, 765 flow [2021-06-13 07:27:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-13 07:27:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-13 07:27:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 912 transitions. [2021-06-13 07:27:49,119 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7821612349914236 [2021-06-13 07:27:49,119 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 912 transitions. [2021-06-13 07:27:49,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 912 transitions. [2021-06-13 07:27:49,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:27:49,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 912 transitions. [2021-06-13 07:27:49,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 82.9090909090909) internal successors, (912), 11 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:49,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:49,122 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:49,122 INFO L185 Difference]: Start difference. First operand has 149 places, 127 transitions, 607 flow. Second operand 11 states and 912 transitions. [2021-06-13 07:27:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 139 transitions, 765 flow [2021-06-13 07:27:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 642 flow, removed 37 selfloop flow, removed 17 redundant places. [2021-06-13 07:27:49,128 INFO L241 Difference]: Finished difference. Result has 145 places, 126 transitions, 539 flow [2021-06-13 07:27:49,129 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=539, PETRI_PLACES=145, PETRI_TRANSITIONS=126} [2021-06-13 07:27:49,129 INFO L335 CegarLoopForPetriNet]: 100 programPoint places, 45 predicate places. [2021-06-13 07:27:49,129 INFO L482 AbstractCegarLoop]: Abstraction has has 145 places, 126 transitions, 539 flow [2021-06-13 07:27:49,129 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:27:49,129 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:27:49,129 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, 1, 1, 1, 1, 1, 1] [2021-06-13 07:27:49,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-13 07:27:49,129 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:27:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:27:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1507074342, now seen corresponding path program 2 times [2021-06-13 07:27:49,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:27:49,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280785454] [2021-06-13 07:27:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:27:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:27:49,155 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:27:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:27:49,179 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:27:49,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 07:27:49,203 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 07:27:49,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-13 07:27:49,204 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-13 07:27:49,205 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-13 07:27:49,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.06 07:27:49 BasicIcfg [2021-06-13 07:27:49,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-13 07:27:49,296 INFO L168 Benchmark]: Toolchain (without parser) took 6465.76 ms. Allocated memory was 199.2 MB in the beginning and 402.7 MB in the end (delta: 203.4 MB). Free memory was 162.1 MB in the beginning and 277.3 MB in the end (delta: -115.2 MB). Peak memory consumption was 89.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:27:49,296 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 199.2 MB. Free memory is still 180.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 07:27:49,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.87 ms. Allocated memory is still 199.2 MB. Free memory was 161.8 MB in the beginning and 157.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-13 07:27:49,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.26 ms. Allocated memory is still 199.2 MB. Free memory was 156.8 MB in the beginning and 154.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:27:49,296 INFO L168 Benchmark]: Boogie Preprocessor took 26.54 ms. Allocated memory is still 199.2 MB. Free memory was 154.3 MB in the beginning and 152.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:27:49,296 INFO L168 Benchmark]: RCFGBuilder took 1377.06 ms. Allocated memory was 199.2 MB in the beginning and 259.0 MB in the end (delta: 59.8 MB). Free memory was 152.0 MB in the beginning and 137.2 MB in the end (delta: 14.8 MB). Peak memory consumption was 78.3 MB. Max. memory is 8.0 GB. [2021-06-13 07:27:49,296 INFO L168 Benchmark]: TraceAbstraction took 4577.87 ms. Allocated memory was 259.0 MB in the beginning and 402.7 MB in the end (delta: 143.7 MB). Free memory was 136.6 MB in the beginning and 277.3 MB in the end (delta: -140.7 MB). Peak memory consumption was 3.0 MB. Max. memory is 8.0 GB. [2021-06-13 07:27:49,297 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 199.2 MB. Free memory is still 180.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 445.87 ms. Allocated memory is still 199.2 MB. Free memory was 161.8 MB in the beginning and 157.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 33.26 ms. Allocated memory is still 199.2 MB. Free memory was 156.8 MB in the beginning and 154.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 26.54 ms. Allocated memory is still 199.2 MB. Free memory was 154.3 MB in the beginning and 152.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1377.06 ms. Allocated memory was 199.2 MB in the beginning and 259.0 MB in the end (delta: 59.8 MB). Free memory was 152.0 MB in the beginning and 137.2 MB in the end (delta: 14.8 MB). Peak memory consumption was 78.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4577.87 ms. Allocated memory was 259.0 MB in the beginning and 402.7 MB in the end (delta: 143.7 MB). Free memory was 136.6 MB in the beginning and 277.3 MB in the end (delta: -140.7 MB). Peak memory consumption was 3.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L818] 0 pthread_t t1810; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L819] FCALL, FORK 0 pthread_create(&t1810, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L820] 0 pthread_t t1811; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L821] FCALL, FORK 0 pthread_create(&t1811, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L822] 0 pthread_t t1812; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L823] FCALL, FORK 0 pthread_create(&t1812, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2] [L796] 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) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] 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) [L796] 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) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 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 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 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 [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L747] 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) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2] [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] 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)) [L841] 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)) [L842] 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)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] 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)) [L842] 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)) [L843] 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)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] 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)) [L843] 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)) [L844] 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)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] 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)) [L844] 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)) [L845] 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)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] 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)) [L845] 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)) [L846] 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)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 34.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 370.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 103.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, InterpolantAutomatonStates: 3, 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: 4.5ms SsaConstructionTime, 27.6ms SatisfiabilityAnalysisTime, 133.3ms InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4005.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2330.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 132 SDtfs, 305 SDslu, 441 SDs, 0 SdLazy, 696 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 514.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1338.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=10, InterpolantAutomatonStates: 131, 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.8ms SsaConstructionTime, 388.2ms SatisfiabilityAnalysisTime, 1117.2ms InterpolantComputationTime, 976 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 882 ConstructedInterpolants, 0 QuantifiedInterpolants, 3868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...