/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/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 17:00:27,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 17:00:27,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 17:00:27,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 17:00:27,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 17:00:27,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 17:00:27,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 17:00:27,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 17:00:27,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 17:00:27,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 17:00:27,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 17:00:27,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 17:00:27,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 17:00:27,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 17:00:27,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 17:00:27,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 17:00:27,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 17:00:27,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 17:00:27,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 17:00:27,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 17:00:27,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 17:00:27,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 17:00:27,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 17:00:27,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 17:00:27,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 17:00:27,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 17:00:27,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 17:00:27,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 17:00:27,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 17:00:27,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 17:00:27,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 17:00:27,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 17:00:27,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 17:00:27,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 17:00:27,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 17:00:27,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 17:00:27,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 17:00:27,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 17:00:27,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 17:00:28,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 17:00:28,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 17:00:28,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 17:00:28,040 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 17:00:28,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 17:00:28,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 17:00:28,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 17:00:28,042 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 17:00:28,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 17:00:28,043 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 17:00:28,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 17:00:28,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 17:00:28,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 17:00:28,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 17:00:28,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 17:00:28,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 17:00:28,045 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 17:00:28,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 17:00:28,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 17:00:28,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 17:00:28,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 17:00:28,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 17:00:28,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 17:00:28,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 17:00:28,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 17:00:28,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 17:00:28,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 17:00:28,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 17:00:28,048 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 17:00:28,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 17:00:28,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 17:00:28,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 17:00:28,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 17:00:28,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 17:00:28,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 17:00:28,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 17:00:28,330 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 17:00:28,330 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 17:00:28,331 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2020-10-09 17:00:28,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8950026f0/e6e6beba9a1d414bb777455d4c8b677f/FLAG95647f759 [2020-10-09 17:00:28,945 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 17:00:28,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2020-10-09 17:00:28,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8950026f0/e6e6beba9a1d414bb777455d4c8b677f/FLAG95647f759 [2020-10-09 17:00:29,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8950026f0/e6e6beba9a1d414bb777455d4c8b677f [2020-10-09 17:00:29,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 17:00:29,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 17:00:29,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 17:00:29,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 17:00:29,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 17:00:29,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:00:29" (1/1) ... [2020-10-09 17:00:29,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20075267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:29, skipping insertion in model container [2020-10-09 17:00:29,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:00:29" (1/1) ... [2020-10-09 17:00:29,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 17:00:29,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 17:00:29,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:00:29,916 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 17:00:29,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:00:30,054 INFO L208 MainTranslator]: Completed translation [2020-10-09 17:00:30,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30 WrapperNode [2020-10-09 17:00:30,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 17:00:30,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 17:00:30,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 17:00:30,056 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 17:00:30,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 17:00:30,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 17:00:30,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 17:00:30,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 17:00:30,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (1/1) ... [2020-10-09 17:00:30,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 17:00:30,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 17:00:30,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 17:00:30,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 17:00:30,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (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-09 17:00:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 17:00:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 17:00:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 17:00:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 17:00:30,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 17:00:30,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 17:00:30,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 17:00:30,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 17:00:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 17:00:30,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 17:00:30,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 17:00:30,232 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 17:00:31,885 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 17:00:31,885 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 17:00:31,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:00:31 BoogieIcfgContainer [2020-10-09 17:00:31,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 17:00:31,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 17:00:31,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 17:00:31,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 17:00:31,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 05:00:29" (1/3) ... [2020-10-09 17:00:31,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b7378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:00:31, skipping insertion in model container [2020-10-09 17:00:31,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:00:30" (2/3) ... [2020-10-09 17:00:31,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b7378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:00:31, skipping insertion in model container [2020-10-09 17:00:31,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:00:31" (3/3) ... [2020-10-09 17:00:31,897 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2020-10-09 17:00:31,909 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 17:00:31,917 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 17:00:31,918 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 17:00:31,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,958 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,966 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:00:31,996 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-09 17:00:32,017 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 17:00:32,017 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 17:00:32,017 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 17:00:32,017 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 17:00:32,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 17:00:32,018 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 17:00:32,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 17:00:32,018 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 17:00:32,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-09 17:00:32,070 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-09 17:00:32,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:00:32,075 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-09 17:00:32,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 78 transitions, 166 flow [2020-10-09 17:00:32,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 158 flow [2020-10-09 17:00:32,096 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2020-10-09 17:00:32,096 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:00:32,096 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:32,098 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] [2020-10-09 17:00:32,098 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1854767798, now seen corresponding path program 1 times [2020-10-09 17:00:32,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:32,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218558167] [2020-10-09 17:00:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:00:32,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:00:32,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:00:32,275 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-09 17:00:32,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:00:32,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:32,340 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-09 17:00:32,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218558167] [2020-10-09 17:00:32,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:00:32,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 17:00:32,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393734526] [2020-10-09 17:00:32,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 17:00:32,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:00:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 17:00:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 17:00:32,486 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 78 [2020-10-09 17:00:32,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 158 flow. Second operand 4 states. [2020-10-09 17:00:32,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:00:32,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 78 [2020-10-09 17:00:32,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:00:32,522 INFO L129 PetriNetUnfolder]: 0/73 cut-off events. [2020-10-09 17:00:32,523 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:00:32,523 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 73 events. 0/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 4/75 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 17:00:32,525 INFO L132 encePairwiseOnDemand]: 73/78 looper letters, 0 selfloop transitions, 2 changer transitions 9/73 dead transitions. [2020-10-09 17:00:32,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 156 flow [2020-10-09 17:00:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 17:00:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 17:00:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2020-10-09 17:00:32,540 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9658119658119658 [2020-10-09 17:00:32,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 226 transitions. [2020-10-09 17:00:32,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 226 transitions. [2020-10-09 17:00:32,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:00:32,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 226 transitions. [2020-10-09 17:00:32,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 17:00:32,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 17:00:32,556 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 17:00:32,558 INFO L185 Difference]: Start difference. First operand has 81 places, 76 transitions, 158 flow. Second operand 3 states and 226 transitions. [2020-10-09 17:00:32,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 156 flow [2020-10-09 17:00:32,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 17:00:32,568 INFO L241 Difference]: Finished difference. Result has 80 places, 64 transitions, 136 flow [2020-10-09 17:00:32,571 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2020-10-09 17:00:32,572 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, -1 predicate places. [2020-10-09 17:00:32,572 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 136 flow [2020-10-09 17:00:32,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 17:00:32,573 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:32,573 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] [2020-10-09 17:00:32,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 17:00:32,781 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 120328011, now seen corresponding path program 1 times [2020-10-09 17:00:32,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:32,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324263543] [2020-10-09 17:00:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:00:32,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 17:00:32,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:00:32,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:00:32,948 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-09 17:00:32,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:00:32,999 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-09 17:00:33,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324263543] [2020-10-09 17:00:33,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:00:33,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:00:33,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445006939] [2020-10-09 17:00:33,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:00:33,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:00:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:00:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:00:33,157 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 78 [2020-10-09 17:00:33,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 136 flow. Second operand 8 states. [2020-10-09 17:00:33,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:00:33,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 78 [2020-10-09 17:00:33,158 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:00:33,248 INFO L129 PetriNetUnfolder]: 3/87 cut-off events. [2020-10-09 17:00:33,248 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:00:33,249 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 87 events. 3/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 75. Up to 7 conditions per place. [2020-10-09 17:00:33,249 INFO L132 encePairwiseOnDemand]: 72/78 looper letters, 6 selfloop transitions, 2 changer transitions 10/74 dead transitions. [2020-10-09 17:00:33,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 74 transitions, 192 flow [2020-10-09 17:00:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 17:00:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 17:00:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 632 transitions. [2020-10-09 17:00:33,255 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9002849002849003 [2020-10-09 17:00:33,255 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 632 transitions. [2020-10-09 17:00:33,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 632 transitions. [2020-10-09 17:00:33,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:00:33,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 632 transitions. [2020-10-09 17:00:33,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 17:00:33,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 17:00:33,262 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 17:00:33,263 INFO L185 Difference]: Start difference. First operand has 80 places, 64 transitions, 136 flow. Second operand 9 states and 632 transitions. [2020-10-09 17:00:33,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 74 transitions, 192 flow [2020-10-09 17:00:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 17:00:33,267 INFO L241 Difference]: Finished difference. Result has 84 places, 64 transitions, 152 flow [2020-10-09 17:00:33,267 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=152, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2020-10-09 17:00:33,268 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2020-10-09 17:00:33,268 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 152 flow [2020-10-09 17:00:33,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:00:33,268 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:33,268 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] [2020-10-09 17:00:33,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 17:00:33,482 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:33,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1248487777, now seen corresponding path program 1 times [2020-10-09 17:00:33,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:33,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82187045] [2020-10-09 17:00:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:00:33,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 17:00:33,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:00:33,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:00:33,608 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-09 17:00:33,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:00:33,648 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-09 17:00:33,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82187045] [2020-10-09 17:00:33,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:00:33,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:00:33,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399497699] [2020-10-09 17:00:33,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:00:33,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:00:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:00:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:00:33,888 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 78 [2020-10-09 17:00:33,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 152 flow. Second operand 8 states. [2020-10-09 17:00:33,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:00:33,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 78 [2020-10-09 17:00:33,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:00:34,009 INFO L129 PetriNetUnfolder]: 3/95 cut-off events. [2020-10-09 17:00:34,009 INFO L130 PetriNetUnfolder]: For 18/25 co-relation queries the response was YES. [2020-10-09 17:00:34,010 INFO L80 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 95 events. 3/95 cut-off events. For 18/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 146. Up to 9 conditions per place. [2020-10-09 17:00:34,011 INFO L132 encePairwiseOnDemand]: 71/78 looper letters, 7 selfloop transitions, 2 changer transitions 11/75 dead transitions. [2020-10-09 17:00:34,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 75 transitions, 232 flow [2020-10-09 17:00:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 17:00:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 17:00:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 625 transitions. [2020-10-09 17:00:34,014 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8903133903133903 [2020-10-09 17:00:34,014 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 625 transitions. [2020-10-09 17:00:34,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 625 transitions. [2020-10-09 17:00:34,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:00:34,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 625 transitions. [2020-10-09 17:00:34,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 17:00:34,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 17:00:34,017 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 17:00:34,017 INFO L185 Difference]: Start difference. First operand has 84 places, 64 transitions, 152 flow. Second operand 9 states and 625 transitions. [2020-10-09 17:00:34,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 75 transitions, 232 flow [2020-10-09 17:00:34,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 200 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-09 17:00:34,021 INFO L241 Difference]: Finished difference. Result has 86 places, 64 transitions, 160 flow [2020-10-09 17:00:34,022 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2020-10-09 17:00:34,022 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 5 predicate places. [2020-10-09 17:00:34,022 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 160 flow [2020-10-09 17:00:34,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:00:34,022 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:34,022 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] [2020-10-09 17:00:34,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 17:00:34,235 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:34,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1388070496, now seen corresponding path program 1 times [2020-10-09 17:00:34,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:34,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024024019] [2020-10-09 17:00:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:00:34,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:00:34,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:00:34,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:00:34,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:00:34,391 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-09 17:00:34,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:00:34,446 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-09 17:00:34,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024024019] [2020-10-09 17:00:34,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:00:34,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2020-10-09 17:00:34,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98684219] [2020-10-09 17:00:34,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 17:00:34,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:00:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 17:00:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-09 17:00:34,721 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 78 [2020-10-09 17:00:34,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 64 transitions, 160 flow. Second operand 9 states. [2020-10-09 17:00:34,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:00:34,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 78 [2020-10-09 17:00:34,723 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:00:34,831 INFO L129 PetriNetUnfolder]: 0/83 cut-off events. [2020-10-09 17:00:34,831 INFO L130 PetriNetUnfolder]: For 25/44 co-relation queries the response was YES. [2020-10-09 17:00:34,832 INFO L80 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 83 events. 0/83 cut-off events. For 25/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 3/86 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2020-10-09 17:00:34,832 INFO L132 encePairwiseOnDemand]: 71/78 looper letters, 9 selfloop transitions, 2 changer transitions 5/69 dead transitions. [2020-10-09 17:00:34,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 69 transitions, 215 flow [2020-10-09 17:00:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 17:00:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-09 17:00:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 537 transitions. [2020-10-09 17:00:34,835 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8605769230769231 [2020-10-09 17:00:34,835 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 537 transitions. [2020-10-09 17:00:34,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 537 transitions. [2020-10-09 17:00:34,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:00:34,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 537 transitions. [2020-10-09 17:00:34,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-09 17:00:34,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-09 17:00:34,839 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-09 17:00:34,839 INFO L185 Difference]: Start difference. First operand has 86 places, 64 transitions, 160 flow. Second operand 8 states and 537 transitions. [2020-10-09 17:00:34,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 69 transitions, 215 flow [2020-10-09 17:00:34,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 69 transitions, 191 flow, removed 10 selfloop flow, removed 8 redundant places. [2020-10-09 17:00:34,843 INFO L241 Difference]: Finished difference. Result has 84 places, 64 transitions, 159 flow [2020-10-09 17:00:34,843 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2020-10-09 17:00:34,844 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2020-10-09 17:00:34,844 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 159 flow [2020-10-09 17:00:34,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 17:00:34,844 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:34,844 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] [2020-10-09 17:00:35,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 17:00:35,057 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1388239342, now seen corresponding path program 2 times [2020-10-09 17:00:35,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:35,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245246770] [2020-10-09 17:00:35,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:35,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 17:00:35,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 17:00:35,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 17:00:35,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:00:35,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:00:35,184 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-09 17:00:35,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:00:35,211 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-09 17:00:35,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245246770] [2020-10-09 17:00:35,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:00:35,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:00:35,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844065783] [2020-10-09 17:00:35,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:00:35,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:00:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:00:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:00:35,293 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 78 [2020-10-09 17:00:35,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 159 flow. Second operand 8 states. [2020-10-09 17:00:35,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:00:35,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 78 [2020-10-09 17:00:35,294 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:00:35,440 INFO L129 PetriNetUnfolder]: 24/133 cut-off events. [2020-10-09 17:00:35,440 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 17:00:35,441 INFO L80 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 133 events. 24/133 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 384 event pairs, 0 based on Foata normal form. 6/133 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2020-10-09 17:00:35,441 INFO L132 encePairwiseOnDemand]: 70/78 looper letters, 4 selfloop transitions, 7 changer transitions 19/85 dead transitions. [2020-10-09 17:00:35,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 261 flow [2020-10-09 17:00:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 17:00:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 17:00:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 825 transitions. [2020-10-09 17:00:35,445 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8814102564102564 [2020-10-09 17:00:35,445 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 825 transitions. [2020-10-09 17:00:35,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 825 transitions. [2020-10-09 17:00:35,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:00:35,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 825 transitions. [2020-10-09 17:00:35,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 17:00:35,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 17:00:35,450 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 17:00:35,450 INFO L185 Difference]: Start difference. First operand has 84 places, 64 transitions, 159 flow. Second operand 12 states and 825 transitions. [2020-10-09 17:00:35,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 261 flow [2020-10-09 17:00:35,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 85 transitions, 242 flow, removed 6 selfloop flow, removed 8 redundant places. [2020-10-09 17:00:35,454 INFO L241 Difference]: Finished difference. Result has 92 places, 66 transitions, 186 flow [2020-10-09 17:00:35,454 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=186, PETRI_PLACES=92, PETRI_TRANSITIONS=66} [2020-10-09 17:00:35,455 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 11 predicate places. [2020-10-09 17:00:35,455 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 66 transitions, 186 flow [2020-10-09 17:00:35,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:00:35,455 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:35,455 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-09 17:00:35,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 17:00:35,670 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -467173612, now seen corresponding path program 1 times [2020-10-09 17:00:35,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:35,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034878018] [2020-10-09 17:00:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:00:35,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 26 conjunts are in the unsatisfiable core [2020-10-09 17:00:35,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:00:35,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:00:36,021 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-09 17:00:36,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:00:36,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:00:36,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 1] term [2020-10-09 17:00:36,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-09 17:00:36,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 3, 3, 2, 1] term [2020-10-09 17:00:36,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,262 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 17:00:36,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:00:36,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:00:36,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:00:36,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:00:36,293 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 17:00:36,303 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 17:00:36,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-09 17:00:36,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 17:00:36,409 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-09 17:00:36,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034878018] [2020-10-09 17:00:36,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:00:36,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 14 [2020-10-09 17:00:36,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779553905] [2020-10-09 17:00:36,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 17:00:36,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:00:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 17:00:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-10-09 17:00:37,332 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 78 [2020-10-09 17:00:37,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 66 transitions, 186 flow. Second operand 14 states. [2020-10-09 17:00:37,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:00:37,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 78 [2020-10-09 17:00:37,334 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:00:37,546 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-09 17:00:37,546 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-09 17:00:37,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 105 events. 2/105 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 event pairs, 0 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 157. Up to 16 conditions per place. [2020-10-09 17:00:37,547 INFO L132 encePairwiseOnDemand]: 70/78 looper letters, 13 selfloop transitions, 3 changer transitions 8/74 dead transitions. [2020-10-09 17:00:37,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 74 transitions, 250 flow [2020-10-09 17:00:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 17:00:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 17:00:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 556 transitions. [2020-10-09 17:00:37,549 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.792022792022792 [2020-10-09 17:00:37,550 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 556 transitions. [2020-10-09 17:00:37,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 556 transitions. [2020-10-09 17:00:37,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:00:37,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 556 transitions. [2020-10-09 17:00:37,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 17:00:37,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 17:00:37,553 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 17:00:37,553 INFO L185 Difference]: Start difference. First operand has 92 places, 66 transitions, 186 flow. Second operand 9 states and 556 transitions. [2020-10-09 17:00:37,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 74 transitions, 250 flow [2020-10-09 17:00:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 218 flow, removed 9 selfloop flow, removed 11 redundant places. [2020-10-09 17:00:37,556 INFO L241 Difference]: Finished difference. Result has 88 places, 66 transitions, 172 flow [2020-10-09 17:00:37,557 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=172, PETRI_PLACES=88, PETRI_TRANSITIONS=66} [2020-10-09 17:00:37,557 INFO L341 CegarLoopForPetriNet]: 81 programPoint places, 7 predicate places. [2020-10-09 17:00:37,557 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 66 transitions, 172 flow [2020-10-09 17:00:37,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 17:00:37,557 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:00:37,558 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-09 17:00:37,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 17:00:37,770 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:00:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:00:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 622417118, now seen corresponding path program 2 times [2020-10-09 17:00:37,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:00:37,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780388117] [2020-10-09 17:00:37,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 17:00:37,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 17:00:37,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 17:00:37,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:00:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 17:00:37,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:00:38,059 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 17:00:38,060 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 17:00:38,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 17:00:38,325 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-09 17:00:38,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,328 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-09 17:00:38,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,328 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-09 17:00:38,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,328 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-09 17:00:38,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,328 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-09 17:00:38,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,329 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-09 17:00:38,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,329 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-09 17:00:38,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,329 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-09 17:00:38,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,330 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-09 17:00:38,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,330 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-09 17:00:38,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,331 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-09 17:00:38,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,331 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-09 17:00:38,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,331 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-09 17:00:38,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,332 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-09 17:00:38,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,332 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-09 17:00:38,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,333 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-09 17:00:38,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,333 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-09 17:00:38,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,334 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-09 17:00:38,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,334 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-09 17:00:38,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,334 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-09 17:00:38,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:00:38,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 05:00:38 BasicIcfg [2020-10-09 17:00:38,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 17:00:38,439 INFO L168 Benchmark]: Toolchain (without parser) took 9191.64 ms. Allocated memory was 253.8 MB in the beginning and 488.1 MB in the end (delta: 234.4 MB). Free memory was 209.7 MB in the beginning and 397.0 MB in the end (delta: -187.2 MB). Peak memory consumption was 47.1 MB. Max. memory is 14.2 GB. [2020-10-09 17:00:38,439 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:00:38,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.55 ms. Allocated memory was 253.8 MB in the beginning and 319.3 MB in the end (delta: 65.5 MB). Free memory was 209.7 MB in the beginning and 272.1 MB in the end (delta: -62.4 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. [2020-10-09 17:00:38,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.12 ms. Allocated memory is still 319.3 MB. Free memory was 272.1 MB in the beginning and 269.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. [2020-10-09 17:00:38,442 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 17:00:38,443 INFO L168 Benchmark]: RCFGBuilder took 1723.14 ms. Allocated memory was 319.3 MB in the beginning and 359.7 MB in the end (delta: 40.4 MB). Free memory was 267.0 MB in the beginning and 247.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. [2020-10-09 17:00:38,443 INFO L168 Benchmark]: TraceAbstraction took 6546.65 ms. Allocated memory was 359.7 MB in the beginning and 488.1 MB in the end (delta: 128.5 MB). Free memory was 247.6 MB in the beginning and 397.0 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 17:00:38,448 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.20 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 807.55 ms. Allocated memory was 253.8 MB in the beginning and 319.3 MB in the end (delta: 65.5 MB). Free memory was 209.7 MB in the beginning and 272.1 MB in the end (delta: -62.4 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.12 ms. Allocated memory is still 319.3 MB. Free memory was 272.1 MB in the beginning and 269.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1723.14 ms. Allocated memory was 319.3 MB in the beginning and 359.7 MB in the end (delta: 40.4 MB). Free memory was 267.0 MB in the beginning and 247.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6546.65 ms. Allocated memory was 359.7 MB in the beginning and 488.1 MB in the end (delta: 128.5 MB). Free memory was 247.6 MB in the beginning and 397.0 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L702] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L704] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L706] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L708] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L710] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L711] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L712] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L713] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L714] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L715] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L716] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L717] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L718] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L720] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L721] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L722] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1635; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L803] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L804] 0 pthread_t t1636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L805] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L8] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 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: 6.2s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 SDtfs, 221 SDslu, 612 SDs, 0 SdLazy, 498 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 639 GetRequests, 566 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 82497 SizeOfPredicates, 57 NumberOfNonLiveVariables, 851 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...