/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:16:23,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:16:23,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:16:23,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:16:23,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:16:23,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:16:23,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:16:23,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:16:23,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:16:23,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:16:23,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:16:23,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:16:23,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:16:23,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:16:23,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:16:23,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:16:23,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:16:23,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:16:23,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:16:23,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:16:24,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:16:24,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:16:24,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:16:24,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:16:24,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:16:24,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:16:24,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:16:24,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:16:24,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:16:24,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:16:24,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:16:24,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:16:24,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:16:24,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:16:24,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:16:24,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:16:24,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:16:24,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:16:24,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:16:24,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:16:24,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:16:24,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:16:24,079 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:16:24,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:16:24,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:16:24,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:16:24,081 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:16:24,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:16:24,082 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:16:24,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:16:24,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:16:24,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:16:24,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:16:24,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:16:24,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:16:24,084 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:16:24,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:16:24,084 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:16:24,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:16:24,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:16:24,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:16:24,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:16:24,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:16:24,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:16:24,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:16:24,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:16:24,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:16:24,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:16:24,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:16:24,087 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:16:24,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:16:24,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:16:24,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:16:24,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:16:24,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:16:24,403 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:16:24,405 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:16:24,406 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2020-10-11 18:16:24,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045b5ebd4/098ab3b6c7ab418e996a20209f056cbb/FLAG9f6820cd0 [2020-10-11 18:16:25,018 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:16:25,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2020-10-11 18:16:25,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045b5ebd4/098ab3b6c7ab418e996a20209f056cbb/FLAG9f6820cd0 [2020-10-11 18:16:25,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045b5ebd4/098ab3b6c7ab418e996a20209f056cbb [2020-10-11 18:16:25,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:16:25,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:16:25,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:16:25,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:16:25,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:16:25,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:16:25" (1/1) ... [2020-10-11 18:16:25,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b60bac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:25, skipping insertion in model container [2020-10-11 18:16:25,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:16:25" (1/1) ... [2020-10-11 18:16:25,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:16:25,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:16:25,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:16:25,973 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:16:26,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:16:26,113 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:16:26,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26 WrapperNode [2020-10-11 18:16:26,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:16:26,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:16:26,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:16:26,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:16:26,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:16:26,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:16:26,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:16:26,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:16:26,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (1/1) ... [2020-10-11 18:16:26,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:16:26,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:16:26,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:16:26,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:16:26,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (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 [2020-10-11 18:16:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:16:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:16:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:16:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:16:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:16:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:16:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:16:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:16:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:16:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:16:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:16:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:16:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:16:26,310 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:16:28,809 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:16:28,810 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:16:28,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:16:28 BoogieIcfgContainer [2020-10-11 18:16:28,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:16:28,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:16:28,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:16:28,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:16:28,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:16:25" (1/3) ... [2020-10-11 18:16:28,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7791fc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:16:28, skipping insertion in model container [2020-10-11 18:16:28,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:26" (2/3) ... [2020-10-11 18:16:28,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7791fc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:16:28, skipping insertion in model container [2020-10-11 18:16:28,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:16:28" (3/3) ... [2020-10-11 18:16:28,821 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2020-10-11 18:16:28,833 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:16:28,842 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:16:28,843 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:16:28,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,881 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,882 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,882 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,883 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,897 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,905 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,913 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,914 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:28,932 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:16:28,954 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:16:28,955 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:16:28,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:16:28,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:16:28,955 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:16:28,955 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:16:28,955 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:16:28,956 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:16:28,970 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-11 18:16:29,015 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-11 18:16:29,016 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:29,020 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-11 18:16:29,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-11 18:16:29,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-11 18:16:29,042 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2020-10-11 18:16:29,043 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:29,043 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:29,044 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] [2020-10-11 18:16:29,045 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1209636500, now seen corresponding path program 1 times [2020-10-11 18:16:29,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:29,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947001820] [2020-10-11 18:16:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:29,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947001820] [2020-10-11 18:16:29,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:29,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:16:29,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947461231] [2020-10-11 18:16:29,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:16:29,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:16:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:16:29,545 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 93 [2020-10-11 18:16:29,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 189 flow. Second operand 3 states. [2020-10-11 18:16:29,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:29,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 93 [2020-10-11 18:16:29,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:29,579 INFO L129 PetriNetUnfolder]: 0/87 cut-off events. [2020-10-11 18:16:29,580 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:29,580 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 0/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:16:29,582 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 0 selfloop transitions, 2 changer transitions 11/87 dead transitions. [2020-10-11 18:16:29,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 187 flow [2020-10-11 18:16:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:16:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:16:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2020-10-11 18:16:29,599 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9713261648745519 [2020-10-11 18:16:29,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2020-10-11 18:16:29,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2020-10-11 18:16:29,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:29,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2020-10-11 18:16:29,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:16:29,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:16:29,616 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:16:29,618 INFO L185 Difference]: Start difference. First operand has 98 places, 90 transitions, 189 flow. Second operand 3 states and 271 transitions. [2020-10-11 18:16:29,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 187 flow [2020-10-11 18:16:29,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:16:29,627 INFO L241 Difference]: Finished difference. Result has 96 places, 76 transitions, 162 flow [2020-10-11 18:16:29,630 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=96, PETRI_TRANSITIONS=76} [2020-10-11 18:16:29,632 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2020-10-11 18:16:29,632 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 162 flow [2020-10-11 18:16:29,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:16:29,632 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:29,632 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] [2020-10-11 18:16:29,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:16:29,633 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash -375954495, now seen corresponding path program 1 times [2020-10-11 18:16:29,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:29,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733031887] [2020-10-11 18:16:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:29,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733031887] [2020-10-11 18:16:29,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:29,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:29,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658409303] [2020-10-11 18:16:29,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:29,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:29,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:29,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:30,102 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 93 [2020-10-11 18:16:30,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 162 flow. Second operand 6 states. [2020-10-11 18:16:30,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:30,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 93 [2020-10-11 18:16:30,103 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:30,254 INFO L129 PetriNetUnfolder]: 3/92 cut-off events. [2020-10-11 18:16:30,254 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:30,255 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 92 events. 3/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 2/94 useless extension candidates. Maximal degree in co-relation 80. Up to 7 conditions per place. [2020-10-11 18:16:30,256 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 6 selfloop transitions, 2 changer transitions 10/86 dead transitions. [2020-10-11 18:16:30,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 218 flow [2020-10-11 18:16:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:16:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:16:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 767 transitions. [2020-10-11 18:16:30,301 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9163679808841099 [2020-10-11 18:16:30,301 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 767 transitions. [2020-10-11 18:16:30,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 767 transitions. [2020-10-11 18:16:30,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:30,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 767 transitions. [2020-10-11 18:16:30,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:16:30,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:16:30,320 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:16:30,320 INFO L185 Difference]: Start difference. First operand has 96 places, 76 transitions, 162 flow. Second operand 9 states and 767 transitions. [2020-10-11 18:16:30,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 218 flow [2020-10-11 18:16:30,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 86 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:16:30,327 INFO L241 Difference]: Finished difference. Result has 98 places, 76 transitions, 178 flow [2020-10-11 18:16:30,328 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=98, PETRI_TRANSITIONS=76} [2020-10-11 18:16:30,331 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2020-10-11 18:16:30,332 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 76 transitions, 178 flow [2020-10-11 18:16:30,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:30,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:30,332 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] [2020-10-11 18:16:30,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:16:30,333 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1424247143, now seen corresponding path program 1 times [2020-10-11 18:16:30,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:30,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790031066] [2020-10-11 18:16:30,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:30,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790031066] [2020-10-11 18:16:30,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:30,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:30,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205723060] [2020-10-11 18:16:30,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:30,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:30,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:30,816 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 93 [2020-10-11 18:16:30,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 76 transitions, 178 flow. Second operand 6 states. [2020-10-11 18:16:30,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:30,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 93 [2020-10-11 18:16:30,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:30,996 INFO L129 PetriNetUnfolder]: 24/172 cut-off events. [2020-10-11 18:16:30,996 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2020-10-11 18:16:30,998 INFO L80 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 172 events. 24/172 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 574 event pairs, 5 based on Foata normal form. 4/174 useless extension candidates. Maximal degree in co-relation 260. Up to 31 conditions per place. [2020-10-11 18:16:30,999 INFO L132 encePairwiseOnDemand]: 86/93 looper letters, 8 selfloop transitions, 3 changer transitions 19/97 dead transitions. [2020-10-11 18:16:30,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 298 flow [2020-10-11 18:16:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:16:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:16:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 770 transitions. [2020-10-11 18:16:31,002 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9199522102747909 [2020-10-11 18:16:31,003 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 770 transitions. [2020-10-11 18:16:31,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 770 transitions. [2020-10-11 18:16:31,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:31,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 770 transitions. [2020-10-11 18:16:31,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:16:31,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:16:31,009 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:16:31,009 INFO L185 Difference]: Start difference. First operand has 98 places, 76 transitions, 178 flow. Second operand 9 states and 770 transitions. [2020-10-11 18:16:31,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 298 flow [2020-10-11 18:16:31,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 266 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:16:31,013 INFO L241 Difference]: Finished difference. Result has 99 places, 78 transitions, 205 flow [2020-10-11 18:16:31,013 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2020-10-11 18:16:31,014 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2020-10-11 18:16:31,014 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 205 flow [2020-10-11 18:16:31,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:31,014 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:31,014 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] [2020-10-11 18:16:31,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:16:31,015 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -737936968, now seen corresponding path program 1 times [2020-10-11 18:16:31,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:31,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373767569] [2020-10-11 18:16:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:31,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373767569] [2020-10-11 18:16:31,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:31,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:31,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808091025] [2020-10-11 18:16:31,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:31,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:31,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:31,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:31,307 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-11 18:16:31,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 78 transitions, 205 flow. Second operand 6 states. [2020-10-11 18:16:31,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:31,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-11 18:16:31,309 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:31,527 INFO L129 PetriNetUnfolder]: 140/427 cut-off events. [2020-10-11 18:16:31,527 INFO L130 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2020-10-11 18:16:31,538 INFO L80 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 427 events. 140/427 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2361 event pairs, 14 based on Foata normal form. 10/413 useless extension candidates. Maximal degree in co-relation 819. Up to 104 conditions per place. [2020-10-11 18:16:31,542 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 17 selfloop transitions, 14 changer transitions 4/103 dead transitions. [2020-10-11 18:16:31,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 103 transitions, 325 flow [2020-10-11 18:16:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:16:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:16:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 757 transitions. [2020-10-11 18:16:31,548 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9044205495818399 [2020-10-11 18:16:31,548 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 757 transitions. [2020-10-11 18:16:31,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 757 transitions. [2020-10-11 18:16:31,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:31,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 757 transitions. [2020-10-11 18:16:31,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:16:31,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:16:31,553 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:16:31,553 INFO L185 Difference]: Start difference. First operand has 99 places, 78 transitions, 205 flow. Second operand 9 states and 757 transitions. [2020-10-11 18:16:31,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 103 transitions, 325 flow [2020-10-11 18:16:31,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 316 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-11 18:16:31,561 INFO L241 Difference]: Finished difference. Result has 102 places, 90 transitions, 296 flow [2020-10-11 18:16:31,561 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=102, PETRI_TRANSITIONS=90} [2020-10-11 18:16:31,561 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2020-10-11 18:16:31,562 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 296 flow [2020-10-11 18:16:31,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:31,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:31,562 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] [2020-10-11 18:16:31,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:16:31,563 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 39820119, now seen corresponding path program 1 times [2020-10-11 18:16:31,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:31,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3673163] [2020-10-11 18:16:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:31,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3673163] [2020-10-11 18:16:31,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:31,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:31,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461079494] [2020-10-11 18:16:31,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:31,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:31,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:31,905 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 93 [2020-10-11 18:16:31,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 296 flow. Second operand 6 states. [2020-10-11 18:16:31,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:31,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 93 [2020-10-11 18:16:31,907 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:32,133 INFO L129 PetriNetUnfolder]: 81/501 cut-off events. [2020-10-11 18:16:32,134 INFO L130 PetriNetUnfolder]: For 487/544 co-relation queries the response was YES. [2020-10-11 18:16:32,138 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 501 events. 81/501 cut-off events. For 487/544 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3368 event pairs, 24 based on Foata normal form. 21/497 useless extension candidates. Maximal degree in co-relation 1217. Up to 117 conditions per place. [2020-10-11 18:16:32,140 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 14 selfloop transitions, 11 changer transitions 9/104 dead transitions. [2020-10-11 18:16:32,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 416 flow [2020-10-11 18:16:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:16:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:16:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions. [2020-10-11 18:16:32,144 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9127837514934289 [2020-10-11 18:16:32,144 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 764 transitions. [2020-10-11 18:16:32,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 764 transitions. [2020-10-11 18:16:32,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:32,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 764 transitions. [2020-10-11 18:16:32,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:16:32,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:16:32,149 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:16:32,149 INFO L185 Difference]: Start difference. First operand has 102 places, 90 transitions, 296 flow. Second operand 9 states and 764 transitions. [2020-10-11 18:16:32,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 416 flow [2020-10-11 18:16:32,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 406 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-11 18:16:32,157 INFO L241 Difference]: Finished difference. Result has 116 places, 89 transitions, 345 flow [2020-10-11 18:16:32,158 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=116, PETRI_TRANSITIONS=89} [2020-10-11 18:16:32,158 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2020-10-11 18:16:32,158 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 89 transitions, 345 flow [2020-10-11 18:16:32,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:32,159 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:32,159 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] [2020-10-11 18:16:32,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:16:32,160 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1194542853, now seen corresponding path program 1 times [2020-10-11 18:16:32,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:32,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078081954] [2020-10-11 18:16:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:32,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078081954] [2020-10-11 18:16:32,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:32,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:16:32,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106485422] [2020-10-11 18:16:32,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:16:32,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:32,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:16:32,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:16:32,419 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-11 18:16:32,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 89 transitions, 345 flow. Second operand 7 states. [2020-10-11 18:16:32,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:32,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-11 18:16:32,420 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:32,634 INFO L129 PetriNetUnfolder]: 109/391 cut-off events. [2020-10-11 18:16:32,634 INFO L130 PetriNetUnfolder]: For 891/971 co-relation queries the response was YES. [2020-10-11 18:16:32,636 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 391 events. 109/391 cut-off events. For 891/971 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2049 event pairs, 3 based on Foata normal form. 19/395 useless extension candidates. Maximal degree in co-relation 1206. Up to 131 conditions per place. [2020-10-11 18:16:32,640 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 10 selfloop transitions, 9 changer transitions 27/114 dead transitions. [2020-10-11 18:16:32,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 114 transitions, 590 flow [2020-10-11 18:16:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 18:16:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 18:16:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 840 transitions. [2020-10-11 18:16:32,643 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2020-10-11 18:16:32,644 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 840 transitions. [2020-10-11 18:16:32,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 840 transitions. [2020-10-11 18:16:32,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:32,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 840 transitions. [2020-10-11 18:16:32,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 18:16:32,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 18:16:32,649 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 18:16:32,649 INFO L185 Difference]: Start difference. First operand has 116 places, 89 transitions, 345 flow. Second operand 10 states and 840 transitions. [2020-10-11 18:16:32,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 114 transitions, 590 flow [2020-10-11 18:16:32,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 114 transitions, 493 flow, removed 43 selfloop flow, removed 5 redundant places. [2020-10-11 18:16:32,659 INFO L241 Difference]: Finished difference. Result has 122 places, 84 transitions, 320 flow [2020-10-11 18:16:32,659 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=122, PETRI_TRANSITIONS=84} [2020-10-11 18:16:32,660 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 24 predicate places. [2020-10-11 18:16:32,660 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 84 transitions, 320 flow [2020-10-11 18:16:32,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:16:32,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:32,660 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] [2020-10-11 18:16:32,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:16:32,660 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash 86620223, now seen corresponding path program 1 times [2020-10-11 18:16:32,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:32,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986000398] [2020-10-11 18:16:32,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:33,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986000398] [2020-10-11 18:16:33,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:33,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:16:33,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647906398] [2020-10-11 18:16:33,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:16:33,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:16:33,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:16:36,870 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2020-10-11 18:16:36,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 84 transitions, 320 flow. Second operand 15 states. [2020-10-11 18:16:36,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:36,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2020-10-11 18:16:36,872 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:37,218 INFO L129 PetriNetUnfolder]: 111/510 cut-off events. [2020-10-11 18:16:37,219 INFO L130 PetriNetUnfolder]: For 1101/1169 co-relation queries the response was YES. [2020-10-11 18:16:37,222 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 510 events. 111/510 cut-off events. For 1101/1169 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3076 event pairs, 17 based on Foata normal form. 12/505 useless extension candidates. Maximal degree in co-relation 1469. Up to 106 conditions per place. [2020-10-11 18:16:37,225 INFO L132 encePairwiseOnDemand]: 80/93 looper letters, 26 selfloop transitions, 11 changer transitions 8/112 dead transitions. [2020-10-11 18:16:37,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 112 transitions, 526 flow [2020-10-11 18:16:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:16:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:16:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1068 transitions. [2020-10-11 18:16:37,230 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8202764976958525 [2020-10-11 18:16:37,230 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1068 transitions. [2020-10-11 18:16:37,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1068 transitions. [2020-10-11 18:16:37,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:37,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1068 transitions. [2020-10-11 18:16:37,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:16:37,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:16:37,237 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:16:37,237 INFO L185 Difference]: Start difference. First operand has 122 places, 84 transitions, 320 flow. Second operand 14 states and 1068 transitions. [2020-10-11 18:16:37,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 112 transitions, 526 flow [2020-10-11 18:16:37,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 436 flow, removed 37 selfloop flow, removed 14 redundant places. [2020-10-11 18:16:37,245 INFO L241 Difference]: Finished difference. Result has 118 places, 88 transitions, 316 flow [2020-10-11 18:16:37,245 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=316, PETRI_PLACES=118, PETRI_TRANSITIONS=88} [2020-10-11 18:16:37,246 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2020-10-11 18:16:37,246 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 88 transitions, 316 flow [2020-10-11 18:16:37,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:16:37,246 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:37,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] [2020-10-11 18:16:37,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:16:37,247 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2031842319, now seen corresponding path program 2 times [2020-10-11 18:16:37,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:37,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482231] [2020-10-11 18:16:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:37,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482231] [2020-10-11 18:16:37,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:37,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:16:37,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639403921] [2020-10-11 18:16:37,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:16:37,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:16:37,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:16:37,661 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-11 18:16:37,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 88 transitions, 316 flow. Second operand 8 states. [2020-10-11 18:16:37,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:37,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-11 18:16:37,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:37,882 INFO L129 PetriNetUnfolder]: 70/346 cut-off events. [2020-10-11 18:16:37,882 INFO L130 PetriNetUnfolder]: For 648/776 co-relation queries the response was YES. [2020-10-11 18:16:37,884 INFO L80 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 346 events. 70/346 cut-off events. For 648/776 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1880 event pairs, 0 based on Foata normal form. 58/393 useless extension candidates. Maximal degree in co-relation 973. Up to 111 conditions per place. [2020-10-11 18:16:37,886 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 6 selfloop transitions, 14 changer transitions 12/101 dead transitions. [2020-10-11 18:16:37,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 101 transitions, 457 flow [2020-10-11 18:16:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:16:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:16:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 911 transitions. [2020-10-11 18:16:37,890 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8905180840664711 [2020-10-11 18:16:37,890 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 911 transitions. [2020-10-11 18:16:37,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 911 transitions. [2020-10-11 18:16:37,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:37,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 911 transitions. [2020-10-11 18:16:37,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:16:37,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:16:37,897 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:16:37,898 INFO L185 Difference]: Start difference. First operand has 118 places, 88 transitions, 316 flow. Second operand 11 states and 911 transitions. [2020-10-11 18:16:37,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 101 transitions, 457 flow [2020-10-11 18:16:37,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 101 transitions, 403 flow, removed 20 selfloop flow, removed 13 redundant places. [2020-10-11 18:16:37,903 INFO L241 Difference]: Finished difference. Result has 118 places, 88 transitions, 325 flow [2020-10-11 18:16:37,904 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=325, PETRI_PLACES=118, PETRI_TRANSITIONS=88} [2020-10-11 18:16:37,904 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2020-10-11 18:16:37,904 INFO L481 AbstractCegarLoop]: Abstraction has has 118 places, 88 transitions, 325 flow [2020-10-11 18:16:37,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:16:37,904 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:37,904 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] [2020-10-11 18:16:37,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:16:37,905 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1087969393, now seen corresponding path program 1 times [2020-10-11 18:16:37,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:37,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278003421] [2020-10-11 18:16:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:38,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278003421] [2020-10-11 18:16:38,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:38,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:16:38,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780997709] [2020-10-11 18:16:38,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:16:38,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:16:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:16:38,329 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2020-10-11 18:16:38,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 88 transitions, 325 flow. Second operand 7 states. [2020-10-11 18:16:38,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:38,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2020-10-11 18:16:38,330 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:38,441 INFO L129 PetriNetUnfolder]: 19/214 cut-off events. [2020-10-11 18:16:38,442 INFO L130 PetriNetUnfolder]: For 271/285 co-relation queries the response was YES. [2020-10-11 18:16:38,443 INFO L80 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 214 events. 19/214 cut-off events. For 271/285 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 838 event pairs, 0 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 474. Up to 42 conditions per place. [2020-10-11 18:16:38,443 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 9 selfloop transitions, 1 changer transitions 11/93 dead transitions. [2020-10-11 18:16:38,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 93 transitions, 369 flow [2020-10-11 18:16:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:16:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:16:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 583 transitions. [2020-10-11 18:16:38,446 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2020-10-11 18:16:38,446 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 583 transitions. [2020-10-11 18:16:38,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 583 transitions. [2020-10-11 18:16:38,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:38,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 583 transitions. [2020-10-11 18:16:38,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:16:38,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:16:38,450 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:16:38,450 INFO L185 Difference]: Start difference. First operand has 118 places, 88 transitions, 325 flow. Second operand 7 states and 583 transitions. [2020-10-11 18:16:38,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 93 transitions, 369 flow [2020-10-11 18:16:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 93 transitions, 307 flow, removed 19 selfloop flow, removed 13 redundant places. [2020-10-11 18:16:38,455 INFO L241 Difference]: Finished difference. Result has 113 places, 82 transitions, 247 flow [2020-10-11 18:16:38,455 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2020-10-11 18:16:38,455 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2020-10-11 18:16:38,455 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 247 flow [2020-10-11 18:16:38,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:16:38,456 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:38,456 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] [2020-10-11 18:16:38,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:16:38,456 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:38,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash -838787217, now seen corresponding path program 2 times [2020-10-11 18:16:38,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:38,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849518566] [2020-10-11 18:16:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:16:38,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:16:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:16:38,578 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:16:38,622 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:16:38,623 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:16:38,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:16:38,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:16:38,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:16:38 BasicIcfg [2020-10-11 18:16:38,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:16:38,814 INFO L168 Benchmark]: Toolchain (without parser) took 13486.10 ms. Allocated memory was 250.6 MB in the beginning and 569.4 MB in the end (delta: 318.8 MB). Free memory was 203.9 MB in the beginning and 277.8 MB in the end (delta: -73.9 MB). Peak memory consumption was 244.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,815 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 250.6 MB. Free memory is still 224.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:16:38,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.08 ms. Allocated memory was 250.6 MB in the beginning and 312.5 MB in the end (delta: 61.9 MB). Free memory was 203.9 MB in the beginning and 260.6 MB in the end (delta: -56.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.06 ms. Allocated memory is still 312.5 MB. Free memory was 260.6 MB in the beginning and 258.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,819 INFO L168 Benchmark]: Boogie Preprocessor took 45.65 ms. Allocated memory is still 312.5 MB. Free memory was 258.1 MB in the beginning and 255.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,820 INFO L168 Benchmark]: RCFGBuilder took 2578.00 ms. Allocated memory was 312.5 MB in the beginning and 370.7 MB in the end (delta: 58.2 MB). Free memory was 255.6 MB in the beginning and 297.2 MB in the end (delta: -41.6 MB). Peak memory consumption was 145.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,824 INFO L168 Benchmark]: TraceAbstraction took 9995.39 ms. Allocated memory was 370.7 MB in the beginning and 569.4 MB in the end (delta: 198.7 MB). Free memory was 297.2 MB in the beginning and 277.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 218.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,831 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 250.6 MB. Free memory is still 224.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 788.08 ms. Allocated memory was 250.6 MB in the beginning and 312.5 MB in the end (delta: 61.9 MB). Free memory was 203.9 MB in the beginning and 260.6 MB in the end (delta: -56.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 74.06 ms. Allocated memory is still 312.5 MB. Free memory was 260.6 MB in the beginning and 258.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.65 ms. Allocated memory is still 312.5 MB. Free memory was 258.1 MB in the beginning and 255.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2578.00 ms. Allocated memory was 312.5 MB in the beginning and 370.7 MB in the end (delta: 58.2 MB). Free memory was 255.6 MB in the beginning and 297.2 MB in the end (delta: -41.6 MB). Peak memory consumption was 145.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9995.39 ms. Allocated memory was 370.7 MB in the beginning and 569.4 MB in the end (delta: 198.7 MB). Free memory was 297.2 MB in the beginning and 277.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 218.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L702] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L709] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L710] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L711] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L712] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L713] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L714] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L718] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L719] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L720] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L721] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L722] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L723] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L724] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] 0 pthread_t t766; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] 0 pthread_t t767; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] 0 pthread_t t768; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 y$flush_delayed = weak$$choice2 [L782] 3 y$mem_tmp = y [L783] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L783] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L783] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L784] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L784] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L785] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L785] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L785] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L786] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L787] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L787] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L788] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L789] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L789] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = y [L791] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L791] 3 y = y$flush_delayed ? y$mem_tmp : y [L792] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L753] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L802] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L831] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 y$flush_delayed = weak$$choice2 [L841] 0 y$mem_tmp = y [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L843] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L844] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L844] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L845] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L850] 0 y = y$flush_delayed ? y$mem_tmp : y [L851] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 275 SDtfs, 325 SDslu, 1098 SDs, 0 SdLazy, 944 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 121051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...