/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/mix038_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 16:52:02,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 16:52:02,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 16:52:02,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 16:52:02,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 16:52:02,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 16:52:02,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 16:52:02,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 16:52:02,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 16:52:02,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 16:52:02,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 16:52:02,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 16:52:02,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 16:52:02,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 16:52:02,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 16:52:02,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 16:52:02,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 16:52:02,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 16:52:02,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 16:52:02,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 16:52:02,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 16:52:02,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 16:52:02,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 16:52:02,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 16:52:02,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 16:52:02,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 16:52:02,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 16:52:02,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 16:52:02,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 16:52:02,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 16:52:02,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 16:52:02,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 16:52:02,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 16:52:02,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 16:52:02,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 16:52:02,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 16:52:02,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 16:52:02,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 16:52:02,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 16:52:02,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 16:52:02,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 16:52:02,712 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 16:52:02,734 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 16:52:02,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 16:52:02,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 16:52:02,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 16:52:02,736 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 16:52:02,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 16:52:02,737 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 16:52:02,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 16:52:02,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 16:52:02,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 16:52:02,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 16:52:02,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 16:52:02,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 16:52:02,738 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 16:52:02,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 16:52:02,738 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 16:52:02,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 16:52:02,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 16:52:02,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 16:52:02,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 16:52:02,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 16:52:02,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 16:52:02,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 16:52:02,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 16:52:02,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 16:52:02,740 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 16:52:02,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 16:52:02,741 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 16:52:02,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 16:52:02,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 16:52:03,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 16:52:03,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 16:52:03,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 16:52:03,080 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 16:52:03,081 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 16:52:03,082 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2020-10-09 16:52:03,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635986f13/ac41b459a8be489d89f8aabeb2fe7868/FLAGc88c75595 [2020-10-09 16:52:03,651 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 16:52:03,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.opt.i [2020-10-09 16:52:03,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635986f13/ac41b459a8be489d89f8aabeb2fe7868/FLAGc88c75595 [2020-10-09 16:52:03,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/635986f13/ac41b459a8be489d89f8aabeb2fe7868 [2020-10-09 16:52:03,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 16:52:03,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 16:52:03,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 16:52:03,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 16:52:03,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 16:52:03,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:52:03" (1/1) ... [2020-10-09 16:52:03,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5147cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:03, skipping insertion in model container [2020-10-09 16:52:03,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:52:03" (1/1) ... [2020-10-09 16:52:03,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 16:52:04,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 16:52:04,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:52:04,751 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 16:52:04,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:52:04,886 INFO L208 MainTranslator]: Completed translation [2020-10-09 16:52:04,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04 WrapperNode [2020-10-09 16:52:04,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 16:52:04,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 16:52:04,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 16:52:04,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 16:52:04,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 16:52:04,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 16:52:04,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 16:52:04,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 16:52:04,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:04,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (1/1) ... [2020-10-09 16:52:05,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 16:52:05,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 16:52:05,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 16:52:05,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 16:52:05,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (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 16:52:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 16:52:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 16:52:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 16:52:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 16:52:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 16:52:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 16:52:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 16:52:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 16:52:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 16:52:05,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 16:52:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 16:52:05,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 16:52:05,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 16:52:05,069 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 16:52:06,786 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 16:52:06,786 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 16:52:06,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:52:06 BoogieIcfgContainer [2020-10-09 16:52:06,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 16:52:06,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 16:52:06,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 16:52:06,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 16:52:06,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 04:52:03" (1/3) ... [2020-10-09 16:52:06,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72daf8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:52:06, skipping insertion in model container [2020-10-09 16:52:06,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:52:04" (2/3) ... [2020-10-09 16:52:06,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72daf8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:52:06, skipping insertion in model container [2020-10-09 16:52:06,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:52:06" (3/3) ... [2020-10-09 16:52:06,797 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2020-10-09 16:52:06,808 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 16:52:06,815 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 16:52:06,816 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 16:52:06,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,845 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,845 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,856 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,858 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,863 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,874 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:52:06,892 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 16:52:06,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 16:52:06,912 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 16:52:06,912 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 16:52:06,912 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 16:52:06,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 16:52:06,912 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 16:52:06,912 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 16:52:06,913 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 16:52:06,925 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-09 16:52:06,970 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-09 16:52:06,971 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:52:06,976 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-09 16:52:06,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-09 16:52:06,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-09 16:52:06,999 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2020-10-09 16:52:06,999 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:52:07,000 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:07,001 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] [2020-10-09 16:52:07,001 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash 273961825, now seen corresponding path program 1 times [2020-10-09 16:52:07,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:07,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889935561] [2020-10-09 16:52:07,023 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 16:52:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:52:07,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:52:07,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:07,219 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 16:52:07,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:07,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:07,290 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 16:52:07,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889935561] [2020-10-09 16:52:07,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:07,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 16:52:07,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336580765] [2020-10-09 16:52:07,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 16:52:07,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:07,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 16:52:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 16:52:07,422 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 95 [2020-10-09 16:52:07,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 193 flow. Second operand 4 states. [2020-10-09 16:52:07,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:07,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 95 [2020-10-09 16:52:07,457 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:07,495 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2020-10-09 16:52:07,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:52:07,496 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 16:52:07,497 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 0 selfloop transitions, 2 changer transitions 11/89 dead transitions. [2020-10-09 16:52:07,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 191 flow [2020-10-09 16:52:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 16:52:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 16:52:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2020-10-09 16:52:07,513 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9719298245614035 [2020-10-09 16:52:07,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2020-10-09 16:52:07,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2020-10-09 16:52:07,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:07,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2020-10-09 16:52:07,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 16:52:07,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 16:52:07,529 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 16:52:07,532 INFO L185 Difference]: Start difference. First operand has 100 places, 92 transitions, 193 flow. Second operand 3 states and 277 transitions. [2020-10-09 16:52:07,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 191 flow [2020-10-09 16:52:07,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-09 16:52:07,540 INFO L241 Difference]: Finished difference. Result has 98 places, 78 transitions, 166 flow [2020-10-09 16:52:07,543 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2020-10-09 16:52:07,544 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2020-10-09 16:52:07,544 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 166 flow [2020-10-09 16:52:07,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 16:52:07,545 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:07,545 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] [2020-10-09 16:52:07,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 16:52:07,766 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1713361484, now seen corresponding path program 1 times [2020-10-09 16:52:07,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:07,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513890304] [2020-10-09 16:52:07,768 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 16:52:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:52:07,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:52:07,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:07,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:52:07,913 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 16:52:07,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:07,984 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 16:52:07,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513890304] [2020-10-09 16:52:07,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:07,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:52:07,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301526337] [2020-10-09 16:52:07,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:52:07,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:52:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:52:08,112 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2020-10-09 16:52:08,113 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 166 flow. Second operand 8 states. [2020-10-09 16:52:08,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:08,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2020-10-09 16:52:08,114 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:08,212 INFO L129 PetriNetUnfolder]: 3/104 cut-off events. [2020-10-09 16:52:08,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:52:08,214 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 104 events. 3/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 149 event pairs, 0 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 90. Up to 7 conditions per place. [2020-10-09 16:52:08,214 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 6 selfloop transitions, 2 changer transitions 10/88 dead transitions. [2020-10-09 16:52:08,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 222 flow [2020-10-09 16:52:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:52:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:52:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 785 transitions. [2020-10-09 16:52:08,220 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2020-10-09 16:52:08,221 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 785 transitions. [2020-10-09 16:52:08,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 785 transitions. [2020-10-09 16:52:08,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:08,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 785 transitions. [2020-10-09 16:52:08,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:52:08,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:52:08,227 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:52:08,228 INFO L185 Difference]: Start difference. First operand has 98 places, 78 transitions, 166 flow. Second operand 9 states and 785 transitions. [2020-10-09 16:52:08,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 222 flow [2020-10-09 16:52:08,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 16:52:08,232 INFO L241 Difference]: Finished difference. Result has 100 places, 78 transitions, 182 flow [2020-10-09 16:52:08,232 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=100, PETRI_TRANSITIONS=78} [2020-10-09 16:52:08,233 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2020-10-09 16:52:08,233 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 78 transitions, 182 flow [2020-10-09 16:52:08,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:52:08,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:08,233 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:52:08,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 16:52:08,450 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash 468930543, now seen corresponding path program 1 times [2020-10-09 16:52:08,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:08,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007970851] [2020-10-09 16:52:08,452 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 16:52:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:52:08,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:52:08,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:08,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:52:08,583 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 16:52:08,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:08,627 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 16:52:08,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007970851] [2020-10-09 16:52:08,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:08,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:52:08,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159796391] [2020-10-09 16:52:08,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:52:08,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:52:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:52:08,774 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 95 [2020-10-09 16:52:08,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 78 transitions, 182 flow. Second operand 8 states. [2020-10-09 16:52:08,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:08,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 95 [2020-10-09 16:52:08,775 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:08,985 INFO L129 PetriNetUnfolder]: 18/159 cut-off events. [2020-10-09 16:52:08,985 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2020-10-09 16:52:08,986 INFO L80 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 159 events. 18/159 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 488 event pairs, 0 based on Foata normal form. 5/162 useless extension candidates. Maximal degree in co-relation 251. Up to 15 conditions per place. [2020-10-09 16:52:08,987 INFO L132 encePairwiseOnDemand]: 88/95 looper letters, 10 selfloop transitions, 5 changer transitions 23/107 dead transitions. [2020-10-09 16:52:08,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 356 flow [2020-10-09 16:52:08,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 16:52:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-09 16:52:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1133 transitions. [2020-10-09 16:52:08,993 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9174089068825911 [2020-10-09 16:52:08,993 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1133 transitions. [2020-10-09 16:52:08,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1133 transitions. [2020-10-09 16:52:08,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:08,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1133 transitions. [2020-10-09 16:52:08,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-09 16:52:08,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-09 16:52:08,999 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-09 16:52:08,999 INFO L185 Difference]: Start difference. First operand has 100 places, 78 transitions, 182 flow. Second operand 13 states and 1133 transitions. [2020-10-09 16:52:08,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 356 flow [2020-10-09 16:52:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 304 flow, removed 24 selfloop flow, removed 8 redundant places. [2020-10-09 16:52:09,007 INFO L241 Difference]: Finished difference. Result has 109 places, 80 transitions, 208 flow [2020-10-09 16:52:09,007 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=208, PETRI_PLACES=109, PETRI_TRANSITIONS=80} [2020-10-09 16:52:09,007 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2020-10-09 16:52:09,007 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 80 transitions, 208 flow [2020-10-09 16:52:09,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:52:09,007 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:09,008 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:52:09,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 16:52:09,219 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash -730530290, now seen corresponding path program 1 times [2020-10-09 16:52:09,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:09,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740832801] [2020-10-09 16:52:09,222 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 16:52:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:52:09,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 16:52:09,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:09,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:52:09,349 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 16:52:09,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:09,382 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 16:52:09,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740832801] [2020-10-09 16:52:09,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:09,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:52:09,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882152580] [2020-10-09 16:52:09,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:52:09,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:09,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:52:09,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:52:09,489 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-09 16:52:09,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 80 transitions, 208 flow. Second operand 8 states. [2020-10-09 16:52:09,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:09,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-09 16:52:09,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:09,704 INFO L129 PetriNetUnfolder]: 124/409 cut-off events. [2020-10-09 16:52:09,704 INFO L130 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2020-10-09 16:52:09,707 INFO L80 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 409 events. 124/409 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2191 event pairs, 0 based on Foata normal form. 14/396 useless extension candidates. Maximal degree in co-relation 696. Up to 72 conditions per place. [2020-10-09 16:52:09,709 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 10 selfloop transitions, 9 changer transitions 29/118 dead transitions. [2020-10-09 16:52:09,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 380 flow [2020-10-09 16:52:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 16:52:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 16:52:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1035 transitions. [2020-10-09 16:52:09,713 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2020-10-09 16:52:09,713 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1035 transitions. [2020-10-09 16:52:09,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1035 transitions. [2020-10-09 16:52:09,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:09,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1035 transitions. [2020-10-09 16:52:09,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 16:52:09,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 16:52:09,719 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 16:52:09,719 INFO L185 Difference]: Start difference. First operand has 109 places, 80 transitions, 208 flow. Second operand 12 states and 1035 transitions. [2020-10-09 16:52:09,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 380 flow [2020-10-09 16:52:09,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 118 transitions, 357 flow, removed 10 selfloop flow, removed 10 redundant places. [2020-10-09 16:52:09,724 INFO L241 Difference]: Finished difference. Result has 110 places, 86 transitions, 283 flow [2020-10-09 16:52:09,724 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=283, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2020-10-09 16:52:09,724 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2020-10-09 16:52:09,725 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 86 transitions, 283 flow [2020-10-09 16:52:09,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:52:09,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:09,725 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:52:09,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 16:52:09,939 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1310879731, now seen corresponding path program 1 times [2020-10-09 16:52:09,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:09,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318992749] [2020-10-09 16:52:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 16:52:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:52:10,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 16:52:10,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:10,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:52:10,105 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 16:52:10,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:10,142 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 16:52:10,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318992749] [2020-10-09 16:52:10,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:10,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-09 16:52:10,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039043101] [2020-10-09 16:52:10,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 16:52:10,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 16:52:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 16:52:10,260 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 95 [2020-10-09 16:52:10,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 86 transitions, 283 flow. Second operand 10 states. [2020-10-09 16:52:10,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:10,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 95 [2020-10-09 16:52:10,262 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:10,480 INFO L129 PetriNetUnfolder]: 32/185 cut-off events. [2020-10-09 16:52:10,480 INFO L130 PetriNetUnfolder]: For 702/776 co-relation queries the response was YES. [2020-10-09 16:52:10,481 INFO L80 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 185 events. 32/185 cut-off events. For 702/776 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 616 event pairs, 0 based on Foata normal form. 22/201 useless extension candidates. Maximal degree in co-relation 567. Up to 53 conditions per place. [2020-10-09 16:52:10,484 INFO L132 encePairwiseOnDemand]: 86/95 looper letters, 4 selfloop transitions, 12 changer transitions 15/99 dead transitions. [2020-10-09 16:52:10,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 99 transitions, 466 flow [2020-10-09 16:52:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 16:52:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-09 16:52:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 933 transitions. [2020-10-09 16:52:10,488 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8928229665071771 [2020-10-09 16:52:10,488 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 933 transitions. [2020-10-09 16:52:10,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 933 transitions. [2020-10-09 16:52:10,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:10,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 933 transitions. [2020-10-09 16:52:10,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-09 16:52:10,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-09 16:52:10,493 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-09 16:52:10,494 INFO L185 Difference]: Start difference. First operand has 110 places, 86 transitions, 283 flow. Second operand 11 states and 933 transitions. [2020-10-09 16:52:10,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 99 transitions, 466 flow [2020-10-09 16:52:10,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 99 transitions, 376 flow, removed 39 selfloop flow, removed 8 redundant places. [2020-10-09 16:52:10,500 INFO L241 Difference]: Finished difference. Result has 112 places, 84 transitions, 280 flow [2020-10-09 16:52:10,500 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=280, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2020-10-09 16:52:10,500 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2020-10-09 16:52:10,500 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 280 flow [2020-10-09 16:52:10,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 16:52:10,501 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:10,501 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:52:10,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 16:52:10,718 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:10,718 INFO L82 PathProgramCache]: Analyzing trace with hash -906779439, now seen corresponding path program 1 times [2020-10-09 16:52:10,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:10,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267068934] [2020-10-09 16:52:10,719 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 16:52:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:52:10,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:52:10,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:10,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:52:10,910 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 16:52:10,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:10,962 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 16:52:10,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267068934] [2020-10-09 16:52:10,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:10,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 16:52:10,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487376497] [2020-10-09 16:52:10,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 16:52:10,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 16:52:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 16:52:11,159 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2020-10-09 16:52:11,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 280 flow. Second operand 9 states. [2020-10-09 16:52:11,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:11,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2020-10-09 16:52:11,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:11,258 INFO L129 PetriNetUnfolder]: 10/137 cut-off events. [2020-10-09 16:52:11,259 INFO L130 PetriNetUnfolder]: For 111/121 co-relation queries the response was YES. [2020-10-09 16:52:11,259 INFO L80 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 137 events. 10/137 cut-off events. For 111/121 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 259 event pairs, 0 based on Foata normal form. 1/136 useless extension candidates. Maximal degree in co-relation 248. Up to 21 conditions per place. [2020-10-09 16:52:11,260 INFO L132 encePairwiseOnDemand]: 89/95 looper letters, 9 selfloop transitions, 1 changer transitions 5/89 dead transitions. [2020-10-09 16:52:11,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 89 transitions, 322 flow [2020-10-09 16:52:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 16:52:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 16:52:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 597 transitions. [2020-10-09 16:52:11,263 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8977443609022556 [2020-10-09 16:52:11,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 597 transitions. [2020-10-09 16:52:11,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 597 transitions. [2020-10-09 16:52:11,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:11,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 597 transitions. [2020-10-09 16:52:11,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 16:52:11,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 16:52:11,268 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 16:52:11,268 INFO L185 Difference]: Start difference. First operand has 112 places, 84 transitions, 280 flow. Second operand 7 states and 597 transitions. [2020-10-09 16:52:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 89 transitions, 322 flow [2020-10-09 16:52:11,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 236 flow, removed 21 selfloop flow, removed 18 redundant places. [2020-10-09 16:52:11,272 INFO L241 Difference]: Finished difference. Result has 101 places, 84 transitions, 209 flow [2020-10-09 16:52:11,272 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2020-10-09 16:52:11,272 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2020-10-09 16:52:11,273 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 209 flow [2020-10-09 16:52:11,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 16:52:11,273 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:11,273 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:52:11,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 16:52:11,481 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:11,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 44982587, now seen corresponding path program 2 times [2020-10-09 16:52:11,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:11,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959132927] [2020-10-09 16:52:11,484 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 16:52:11,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 16:52:11,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 16:52:11,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-09 16:52:11,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:52:11,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:52:11,721 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 16:52:11,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:52:11,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 16:52:11,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,777 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 16:52:11,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:52:11,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-09 16:52:11,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,807 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-10-09 16:52:11,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 2, 1] term [2020-10-09 16:52:11,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:52:11,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:52:11,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:52:11,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 16:52:11,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-09 16:52:11,899 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:52:11,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-09 16:52:11,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,905 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:52:11,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:52:11,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:52:11,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:52:11,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-09 16:52:11,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:52:12,068 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 16:52:12,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959132927] [2020-10-09 16:52:12,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:52:12,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 13 [2020-10-09 16:52:12,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348525995] [2020-10-09 16:52:12,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 16:52:12,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:52:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 16:52:12,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-10-09 16:52:12,810 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2020-10-09 16:52:12,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 209 flow. Second operand 13 states. [2020-10-09 16:52:12,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:52:12,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2020-10-09 16:52:12,811 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:52:12,976 INFO L129 PetriNetUnfolder]: 12/155 cut-off events. [2020-10-09 16:52:12,976 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-09 16:52:12,977 INFO L80 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 155 events. 12/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 368 event pairs, 0 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 226. Up to 18 conditions per place. [2020-10-09 16:52:12,977 INFO L132 encePairwiseOnDemand]: 87/95 looper letters, 14 selfloop transitions, 2 changer transitions 8/92 dead transitions. [2020-10-09 16:52:12,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 279 flow [2020-10-09 16:52:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:52:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:52:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 709 transitions. [2020-10-09 16:52:12,980 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8292397660818713 [2020-10-09 16:52:12,980 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 709 transitions. [2020-10-09 16:52:12,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 709 transitions. [2020-10-09 16:52:12,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:52:12,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 709 transitions. [2020-10-09 16:52:12,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:52:12,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:52:12,985 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:52:12,985 INFO L185 Difference]: Start difference. First operand has 101 places, 84 transitions, 209 flow. Second operand 9 states and 709 transitions. [2020-10-09 16:52:12,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 279 flow [2020-10-09 16:52:12,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 92 transitions, 264 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-09 16:52:12,988 INFO L241 Difference]: Finished difference. Result has 106 places, 84 transitions, 218 flow [2020-10-09 16:52:12,988 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2020-10-09 16:52:12,988 INFO L341 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2020-10-09 16:52:12,988 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 218 flow [2020-10-09 16:52:12,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 16:52:12,988 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:52:12,989 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:52:13,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 16:52:13,201 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:52:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:52:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash 848938659, now seen corresponding path program 3 times [2020-10-09 16:52:13,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:52:13,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117499091] [2020-10-09 16:52:13,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 16:52:13,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 16:52:13,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 16:52:13,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:52:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 16:52:13,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:52:13,492 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 16:52:13,492 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 16:52:13,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 16:52:13,736 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 16:52:13,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,738 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 16:52:13,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,738 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 16:52:13,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,739 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 16:52:13,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,739 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 16:52:13,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,739 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 16:52:13,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,740 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 16:52:13,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,740 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 16:52:13,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,740 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 16:52:13,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,741 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 16:52:13,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,741 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 16:52:13,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,741 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 16:52:13,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,742 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 16:52:13,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,742 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 16:52:13,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,742 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 16:52:13,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,743 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 16:52:13,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,743 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 16:52:13,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,743 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 16:52:13,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,745 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 16:52:13,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,745 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 16:52:13,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,746 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 16:52:13,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,746 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 16:52:13,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,746 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 16:52:13,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,747 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 16:52:13,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:52:13,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 04:52:13 BasicIcfg [2020-10-09 16:52:13,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 16:52:13,856 INFO L168 Benchmark]: Toolchain (without parser) took 9911.14 ms. Allocated memory was 251.1 MB in the beginning and 474.0 MB in the end (delta: 222.8 MB). Free memory was 207.1 MB in the beginning and 214.1 MB in the end (delta: -7.0 MB). Peak memory consumption was 215.9 MB. Max. memory is 14.2 GB. [2020-10-09 16:52:13,857 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 16:52:13,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 941.80 ms. Allocated memory was 251.1 MB in the beginning and 316.7 MB in the end (delta: 65.5 MB). Free memory was 207.1 MB in the beginning and 267.5 MB in the end (delta: -60.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-09 16:52:13,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 316.7 MB. Free memory was 267.5 MB in the beginning and 265.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 16:52:13,859 INFO L168 Benchmark]: Boogie Preprocessor took 52.57 ms. Allocated memory is still 316.7 MB. Free memory was 265.0 MB in the beginning and 262.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 16:52:13,860 INFO L168 Benchmark]: RCFGBuilder took 1784.78 ms. Allocated memory was 316.7 MB in the beginning and 356.5 MB in the end (delta: 39.8 MB). Free memory was 262.5 MB in the beginning and 235.3 MB in the end (delta: 27.2 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-09 16:52:13,861 INFO L168 Benchmark]: TraceAbstraction took 7063.35 ms. Allocated memory was 356.5 MB in the beginning and 474.0 MB in the end (delta: 117.4 MB). Free memory was 235.3 MB in the beginning and 214.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 138.6 MB. Max. memory is 14.2 GB. [2020-10-09 16:52:13,866 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.24 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 941.80 ms. Allocated memory was 251.1 MB in the beginning and 316.7 MB in the end (delta: 65.5 MB). Free memory was 207.1 MB in the beginning and 267.5 MB in the end (delta: -60.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 316.7 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 52.57 ms. Allocated memory is still 316.7 MB. Free memory was 265.0 MB in the beginning and 262.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1784.78 ms. Allocated memory was 316.7 MB in the beginning and 356.5 MB in the end (delta: 39.8 MB). Free memory was 262.5 MB in the beginning and 235.3 MB in the end (delta: 27.2 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7063.35 ms. Allocated memory was 356.5 MB in the beginning and 474.0 MB in the end (delta: 117.4 MB). Free memory was 235.3 MB in the beginning and 214.1 MB in the end (delta: 21.2 MB). Peak memory consumption was 138.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L704] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L706] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L707] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L708] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L710] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L712] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L713] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L714] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L715] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L716] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L717] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L718] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L719] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L720] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L721] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L722] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] 0 pthread_t t1010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t1010, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] 0 pthread_t t1011; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t1011, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] 0 pthread_t t1012; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t1012, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L784] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L788] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y [L766] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L766] 2 y = y$flush_delayed ? y$mem_tmp : y [L767] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L804] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 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.7s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 SDtfs, 257 SDslu, 662 SDs, 0 SdLazy, 519 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 807 SyntacticMatches, 11 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=4, 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.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 155444 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1247 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...