/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 16:47:54,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 16:47:54,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 16:47:54,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 16:47:54,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 16:47:54,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 16:47:54,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 16:47:54,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 16:47:54,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 16:47:54,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 16:47:54,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 16:47:54,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 16:47:54,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 16:47:54,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 16:47:54,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 16:47:54,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 16:47:54,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 16:47:54,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 16:47:54,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 16:47:54,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 16:47:54,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 16:47:54,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 16:47:54,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 16:47:54,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 16:47:54,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 16:47:54,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 16:47:54,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 16:47:54,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 16:47:54,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 16:47:54,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 16:47:54,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 16:47:54,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 16:47:54,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 16:47:54,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 16:47:54,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 16:47:54,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 16:47:54,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 16:47:54,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 16:47:54,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 16:47:54,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 16:47:54,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 16:47:54,959 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:47:54,984 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 16:47:54,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 16:47:54,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 16:47:54,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 16:47:54,989 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 16:47:54,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 16:47:54,989 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 16:47:54,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 16:47:54,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 16:47:54,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 16:47:54,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 16:47:54,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 16:47:54,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 16:47:54,991 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 16:47:54,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 16:47:54,991 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 16:47:54,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 16:47:54,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 16:47:54,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 16:47:54,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 16:47:54,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 16:47:54,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 16:47:54,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 16:47:54,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 16:47:54,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 16:47:54,993 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 16:47:54,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 16:47:54,993 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 16:47:54,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 16:47:54,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 16:47:55,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 16:47:55,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 16:47:55,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 16:47:55,307 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 16:47:55,307 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 16:47:55,308 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2020-10-09 16:47:55,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ed41cdd/5f4e41ee17534b16b6bfa702d65d6193/FLAG16bca1be9 [2020-10-09 16:47:55,894 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 16:47:55,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2020-10-09 16:47:55,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ed41cdd/5f4e41ee17534b16b6bfa702d65d6193/FLAG16bca1be9 [2020-10-09 16:47:56,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ed41cdd/5f4e41ee17534b16b6bfa702d65d6193 [2020-10-09 16:47:56,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 16:47:56,231 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 16:47:56,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 16:47:56,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 16:47:56,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 16:47:56,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:56,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff41f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56, skipping insertion in model container [2020-10-09 16:47:56,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:56,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 16:47:56,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 16:47:56,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:47:56,793 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 16:47:56,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:47:56,942 INFO L208 MainTranslator]: Completed translation [2020-10-09 16:47:56,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56 WrapperNode [2020-10-09 16:47:56,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 16:47:56,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 16:47:56,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 16:47:56,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 16:47:56,950 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:47:56" (1/1) ... [2020-10-09 16:47:56,972 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:47:56" (1/1) ... [2020-10-09 16:47:57,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 16:47:57,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 16:47:57,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 16:47:57,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 16:47:57,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (1/1) ... [2020-10-09 16:47:57,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 16:47:57,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 16:47:57,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 16:47:57,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 16:47:57,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (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:47:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 16:47:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 16:47:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 16:47:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 16:47:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 16:47:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 16:47:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 16:47:57,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 16:47:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 16:47:57,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 16:47:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 16:47:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 16:47:57,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 16:47:57,125 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:47:59,683 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 16:47:59,684 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 16:47:59,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:47:59 BoogieIcfgContainer [2020-10-09 16:47:59,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 16:47:59,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 16:47:59,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 16:47:59,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 16:47:59,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 04:47:56" (1/3) ... [2020-10-09 16:47:59,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b28a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:47:59, skipping insertion in model container [2020-10-09 16:47:59,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:56" (2/3) ... [2020-10-09 16:47:59,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b28a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:47:59, skipping insertion in model container [2020-10-09 16:47:59,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:47:59" (3/3) ... [2020-10-09 16:47:59,695 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2020-10-09 16:47:59,707 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 16:47:59,716 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 16:47:59,717 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 16:47:59,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,756 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,780 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,782 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,783 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,785 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,787 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,788 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,789 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:59,806 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 16:47:59,829 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 16:47:59,829 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 16:47:59,829 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 16:47:59,830 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 16:47:59,830 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 16:47:59,830 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 16:47:59,830 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 16:47:59,830 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 16:47:59,845 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-09 16:47:59,894 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-09 16:47:59,894 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:47:59,902 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-09 16:47:59,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-09 16:47:59,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-09 16:47:59,945 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2020-10-09 16:47:59,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:47:59,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:59,947 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:59,948 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:47:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1209636500, now seen corresponding path program 1 times [2020-10-09 16:47:59,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:59,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904196310] [2020-10-09 16:47:59,967 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:48:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:48:00,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:48:00,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:00,138 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:48:00,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:00,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:48:00,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904196310] [2020-10-09 16:48:00,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:00,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 16:48:00,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780040249] [2020-10-09 16:48:00,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 16:48:00,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 16:48:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 16:48:00,417 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 93 [2020-10-09 16:48:00,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 189 flow. Second operand 4 states. [2020-10-09 16:48:00,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:00,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 93 [2020-10-09 16:48:00,422 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:00,459 INFO L129 PetriNetUnfolder]: 0/87 cut-off events. [2020-10-09 16:48:00,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:48:00,460 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 0/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 16:48:00,461 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 0 selfloop transitions, 2 changer transitions 11/87 dead transitions. [2020-10-09 16:48:00,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 187 flow [2020-10-09 16:48:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 16:48:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 16:48:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2020-10-09 16:48:00,478 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9713261648745519 [2020-10-09 16:48:00,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2020-10-09 16:48:00,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2020-10-09 16:48:00,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:00,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2020-10-09 16:48:00,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 16:48:00,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 16:48:00,493 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 16:48:00,495 INFO L185 Difference]: Start difference. First operand has 98 places, 90 transitions, 189 flow. Second operand 3 states and 271 transitions. [2020-10-09 16:48:00,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 187 flow [2020-10-09 16:48:00,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-09 16:48:00,505 INFO L241 Difference]: Finished difference. Result has 96 places, 76 transitions, 162 flow [2020-10-09 16:48:00,508 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=96, PETRI_TRANSITIONS=76} [2020-10-09 16:48:00,509 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places. [2020-10-09 16:48:00,509 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 162 flow [2020-10-09 16:48:00,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 16:48:00,509 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:00,509 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:48:00,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 16:48:00,711 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:48:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash -375954495, now seen corresponding path program 1 times [2020-10-09 16:48:00,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:00,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687490279] [2020-10-09 16:48:00,714 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:48:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:48:00,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 16:48:00,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:00,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:00,917 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:48:00,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:00,945 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:48:00,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687490279] [2020-10-09 16:48:00,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:00,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:48:00,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800166528] [2020-10-09 16:48:00,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:48:00,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:48:00,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:48:01,101 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-09 16:48:01,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 162 flow. Second operand 8 states. [2020-10-09 16:48:01,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:01,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-09 16:48:01,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:01,323 INFO L129 PetriNetUnfolder]: 64/240 cut-off events. [2020-10-09 16:48:01,323 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:48:01,325 INFO L80 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 240 events. 64/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 959 event pairs, 0 based on Foata normal form. 8/244 useless extension candidates. Maximal degree in co-relation 334. Up to 36 conditions per place. [2020-10-09 16:48:01,327 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 10 selfloop transitions, 9 changer transitions 29/114 dead transitions. [2020-10-09 16:48:01,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 334 flow [2020-10-09 16:48:01,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 16:48:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 16:48:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1011 transitions. [2020-10-09 16:48:01,334 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9059139784946236 [2020-10-09 16:48:01,335 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1011 transitions. [2020-10-09 16:48:01,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1011 transitions. [2020-10-09 16:48:01,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:01,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1011 transitions. [2020-10-09 16:48:01,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 16:48:01,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 16:48:01,345 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 16:48:01,345 INFO L185 Difference]: Start difference. First operand has 96 places, 76 transitions, 162 flow. Second operand 12 states and 1011 transitions. [2020-10-09 16:48:01,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 334 flow [2020-10-09 16:48:01,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 114 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 16:48:01,349 INFO L241 Difference]: Finished difference. Result has 103 places, 82 transitions, 256 flow [2020-10-09 16:48:01,350 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=256, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2020-10-09 16:48:01,350 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2020-10-09 16:48:01,351 INFO L481 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 256 flow [2020-10-09 16:48:01,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:48:01,351 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:01,351 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] [2020-10-09 16:48:01,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 16:48:01,565 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:48:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:01,566 INFO L82 PathProgramCache]: Analyzing trace with hash -244913331, now seen corresponding path program 1 times [2020-10-09 16:48:01,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:01,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920646404] [2020-10-09 16:48:01,567 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:48:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:48:01,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:48:01,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:01,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:01,729 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:48:01,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:01,787 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:48:01,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920646404] [2020-10-09 16:48:01,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:01,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:48:01,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797431887] [2020-10-09 16:48:01,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:48:01,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:48:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:48:01,943 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 93 [2020-10-09 16:48:01,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 256 flow. Second operand 8 states. [2020-10-09 16:48:01,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:01,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 93 [2020-10-09 16:48:01,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:02,064 INFO L129 PetriNetUnfolder]: 17/163 cut-off events. [2020-10-09 16:48:02,064 INFO L130 PetriNetUnfolder]: For 248/253 co-relation queries the response was YES. [2020-10-09 16:48:02,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 163 events. 17/163 cut-off events. For 248/253 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 443 event pairs, 3 based on Foata normal form. 3/165 useless extension candidates. Maximal degree in co-relation 315. Up to 26 conditions per place. [2020-10-09 16:48:02,067 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 6 selfloop transitions, 2 changer transitions 10/92 dead transitions. [2020-10-09 16:48:02,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 312 flow [2020-10-09 16:48:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:48:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:48:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 767 transitions. [2020-10-09 16:48:02,070 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9163679808841099 [2020-10-09 16:48:02,070 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 767 transitions. [2020-10-09 16:48:02,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 767 transitions. [2020-10-09 16:48:02,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:02,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 767 transitions. [2020-10-09 16:48:02,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:48:02,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:48:02,075 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:48:02,075 INFO L185 Difference]: Start difference. First operand has 103 places, 82 transitions, 256 flow. Second operand 9 states and 767 transitions. [2020-10-09 16:48:02,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 312 flow [2020-10-09 16:48:02,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 282 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-09 16:48:02,081 INFO L241 Difference]: Finished difference. Result has 105 places, 82 transitions, 246 flow [2020-10-09 16:48:02,082 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2020-10-09 16:48:02,082 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2020-10-09 16:48:02,082 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 246 flow [2020-10-09 16:48:02,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:48:02,082 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:02,083 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] [2020-10-09 16:48:02,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 16:48:02,296 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:48:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1873055079, now seen corresponding path program 1 times [2020-10-09 16:48:02,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:02,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48909540] [2020-10-09 16:48:02,297 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:48:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:48:02,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:48:02,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:02,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:02,516 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:48:02,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:02,562 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:48:02,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48909540] [2020-10-09 16:48:02,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:02,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:48:02,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559447234] [2020-10-09 16:48:02,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:48:02,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:02,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:48:02,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:48:02,698 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 93 [2020-10-09 16:48:02,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 246 flow. Second operand 8 states. [2020-10-09 16:48:02,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:02,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 93 [2020-10-09 16:48:02,700 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:02,846 INFO L129 PetriNetUnfolder]: 35/258 cut-off events. [2020-10-09 16:48:02,846 INFO L130 PetriNetUnfolder]: For 254/267 co-relation queries the response was YES. [2020-10-09 16:48:02,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 258 events. 35/258 cut-off events. For 254/267 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1102 event pairs, 6 based on Foata normal form. 7/258 useless extension candidates. Maximal degree in co-relation 553. Up to 51 conditions per place. [2020-10-09 16:48:02,850 INFO L132 encePairwiseOnDemand]: 86/93 looper letters, 11 selfloop transitions, 3 changer transitions 10/97 dead transitions. [2020-10-09 16:48:02,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 97 transitions, 354 flow [2020-10-09 16:48:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:48:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:48:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 764 transitions. [2020-10-09 16:48:02,855 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9127837514934289 [2020-10-09 16:48:02,855 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 764 transitions. [2020-10-09 16:48:02,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 764 transitions. [2020-10-09 16:48:02,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:02,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 764 transitions. [2020-10-09 16:48:02,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:48:02,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:48:02,860 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:48:02,860 INFO L185 Difference]: Start difference. First operand has 105 places, 82 transitions, 246 flow. Second operand 9 states and 764 transitions. [2020-10-09 16:48:02,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 97 transitions, 354 flow [2020-10-09 16:48:02,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 310 flow, removed 20 selfloop flow, removed 8 redundant places. [2020-10-09 16:48:02,865 INFO L241 Difference]: Finished difference. Result has 107 places, 83 transitions, 260 flow [2020-10-09 16:48:02,866 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=107, PETRI_TRANSITIONS=83} [2020-10-09 16:48:02,866 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2020-10-09 16:48:02,866 INFO L481 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 260 flow [2020-10-09 16:48:02,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:48:02,867 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:02,867 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:48:03,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 16:48:03,081 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:48:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash -270627601, now seen corresponding path program 1 times [2020-10-09 16:48:03,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:03,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274538081] [2020-10-09 16:48:03,082 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:48:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:48:03,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 16:48:03,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:03,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:48:03,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:03,367 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:48:03,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274538081] [2020-10-09 16:48:03,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:03,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-09 16:48:03,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997136608] [2020-10-09 16:48:03,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 16:48:03,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 16:48:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 16:48:03,544 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 93 [2020-10-09 16:48:03,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 260 flow. Second operand 10 states. [2020-10-09 16:48:03,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:03,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 93 [2020-10-09 16:48:03,546 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:03,722 INFO L129 PetriNetUnfolder]: 32/184 cut-off events. [2020-10-09 16:48:03,723 INFO L130 PetriNetUnfolder]: For 283/347 co-relation queries the response was YES. [2020-10-09 16:48:03,724 INFO L80 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 184 events. 32/184 cut-off events. For 283/347 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 608 event pairs, 0 based on Foata normal form. 18/195 useless extension candidates. Maximal degree in co-relation 480. Up to 53 conditions per place. [2020-10-09 16:48:03,725 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 4 selfloop transitions, 12 changer transitions 14/96 dead transitions. [2020-10-09 16:48:03,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 96 transitions, 405 flow [2020-10-09 16:48:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 16:48:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-09 16:48:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 911 transitions. [2020-10-09 16:48:03,729 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8905180840664711 [2020-10-09 16:48:03,730 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 911 transitions. [2020-10-09 16:48:03,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 911 transitions. [2020-10-09 16:48:03,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:03,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 911 transitions. [2020-10-09 16:48:03,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-09 16:48:03,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-09 16:48:03,738 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-09 16:48:03,738 INFO L185 Difference]: Start difference. First operand has 107 places, 83 transitions, 260 flow. Second operand 11 states and 911 transitions. [2020-10-09 16:48:03,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 96 transitions, 405 flow [2020-10-09 16:48:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 365 flow, removed 16 selfloop flow, removed 9 redundant places. [2020-10-09 16:48:03,743 INFO L241 Difference]: Finished difference. Result has 108 places, 82 transitions, 274 flow [2020-10-09 16:48:03,744 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=274, PETRI_PLACES=108, PETRI_TRANSITIONS=82} [2020-10-09 16:48:03,744 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 10 predicate places. [2020-10-09 16:48:03,744 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 82 transitions, 274 flow [2020-10-09 16:48:03,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 16:48:03,744 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:03,744 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:48:03,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 16:48:03,958 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:48:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1561967077, now seen corresponding path program 1 times [2020-10-09 16:48:03,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:03,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350392289] [2020-10-09 16:48:03,960 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:48:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:48:04,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-09 16:48:04,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:04,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 16:48:04,294 INFO L603 QuantifierPusher]: Distributing 1 conjuncts over 2 disjuncts [2020-10-09 16:48:04,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:48:04,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:48:04,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:48:04,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:04,607 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:48:04,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:04,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-09 16:48:04,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-09 16:48:04,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 16:48:04,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,695 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-10-09 16:48:04,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,697 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 1] term [2020-10-09 16:48:04,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,827 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-10-09 16:48:04,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-09 16:48:04,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-09 16:48:04,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 2, 1] term [2020-10-09 16:48:04,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,841 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 4, 3, 4, 3, 2, 1] term [2020-10-09 16:48:04,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:48:04,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:48:04,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:48:04,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:48:04,913 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-09 16:48:04,920 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:04,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:04,942 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:04,946 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 3, 4, 4, 3, 3, 2, 2, 1] term [2020-10-09 16:48:04,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:04,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 3, 3, 2, 1] term [2020-10-09 16:48:04,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,115 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 26 [2020-10-09 16:48:05,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-09 16:48:05,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-09 16:48:05,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,146 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-09 16:48:05,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-09 16:48:05,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,181 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:05,185 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,195 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,204 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:05,217 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,228 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,234 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-09 16:48:05,235 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:05,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,341 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:05,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:48:05,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:48:05,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:48:05,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:48:05,589 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,611 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:48:05,665 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 16:48:05,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:48:05,728 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 16:48:05,728 INFO L603 QuantifierPusher]: Distributing 1 disjuncts over 2 conjuncts [2020-10-09 16:48:05,730 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:05,754 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:48:05,812 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:48:05,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350392289] [2020-10-09 16:48:05,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:05,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2020-10-09 16:48:05,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831797429] [2020-10-09 16:48:05,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-09 16:48:05,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-09 16:48:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2020-10-09 16:48:07,621 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2020-10-09 16:48:07,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 82 transitions, 274 flow. Second operand 20 states. [2020-10-09 16:48:07,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:07,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2020-10-09 16:48:07,624 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:07,996 INFO L129 PetriNetUnfolder]: 29/218 cut-off events. [2020-10-09 16:48:07,996 INFO L130 PetriNetUnfolder]: For 155/165 co-relation queries the response was YES. [2020-10-09 16:48:07,998 INFO L80 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 218 events. 29/218 cut-off events. For 155/165 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 795 event pairs, 0 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 427. Up to 31 conditions per place. [2020-10-09 16:48:07,999 INFO L132 encePairwiseOnDemand]: 80/93 looper letters, 17 selfloop transitions, 11 changer transitions 5/95 dead transitions. [2020-10-09 16:48:07,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 95 transitions, 368 flow [2020-10-09 16:48:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 16:48:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-09 16:48:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 944 transitions. [2020-10-09 16:48:08,004 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7808105872622002 [2020-10-09 16:48:08,004 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 944 transitions. [2020-10-09 16:48:08,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 944 transitions. [2020-10-09 16:48:08,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:08,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 944 transitions. [2020-10-09 16:48:08,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-09 16:48:08,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-09 16:48:08,010 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-09 16:48:08,010 INFO L185 Difference]: Start difference. First operand has 108 places, 82 transitions, 274 flow. Second operand 13 states and 944 transitions. [2020-10-09 16:48:08,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 95 transitions, 368 flow [2020-10-09 16:48:08,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 286 flow, removed 21 selfloop flow, removed 16 redundant places. [2020-10-09 16:48:08,019 INFO L241 Difference]: Finished difference. Result has 105 places, 87 transitions, 245 flow [2020-10-09 16:48:08,019 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=245, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2020-10-09 16:48:08,019 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2020-10-09 16:48:08,020 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 245 flow [2020-10-09 16:48:08,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-09 16:48:08,020 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:08,020 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:48:08,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 16:48:08,243 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:48:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1884286871, now seen corresponding path program 2 times [2020-10-09 16:48:08,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:08,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849566883] [2020-10-09 16:48:08,244 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:48:08,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 16:48:08,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 16:48:08,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:48:08,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:48:08,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:48:08,643 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:48:08,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:48:08,684 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:48:08,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849566883] [2020-10-09 16:48:08,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:48:08,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 16:48:08,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618252461] [2020-10-09 16:48:08,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 16:48:08,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:48:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 16:48:08,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 16:48:08,934 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2020-10-09 16:48:08,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 245 flow. Second operand 9 states. [2020-10-09 16:48:08,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:48:08,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2020-10-09 16:48:08,935 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:48:09,041 INFO L129 PetriNetUnfolder]: 31/279 cut-off events. [2020-10-09 16:48:09,041 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 16:48:09,043 INFO L80 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 279 events. 31/279 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1333 event pairs, 0 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 421. Up to 36 conditions per place. [2020-10-09 16:48:09,043 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 9 selfloop transitions, 1 changer transitions 10/92 dead transitions. [2020-10-09 16:48:09,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 92 transitions, 291 flow [2020-10-09 16:48:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 16:48:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 16:48:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 583 transitions. [2020-10-09 16:48:09,046 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8955453149001537 [2020-10-09 16:48:09,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 583 transitions. [2020-10-09 16:48:09,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 583 transitions. [2020-10-09 16:48:09,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:48:09,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 583 transitions. [2020-10-09 16:48:09,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 16:48:09,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 16:48:09,050 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 16:48:09,050 INFO L185 Difference]: Start difference. First operand has 105 places, 87 transitions, 245 flow. Second operand 7 states and 583 transitions. [2020-10-09 16:48:09,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 92 transitions, 291 flow [2020-10-09 16:48:09,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 92 transitions, 268 flow, removed 7 selfloop flow, removed 8 redundant places. [2020-10-09 16:48:09,054 INFO L241 Difference]: Finished difference. Result has 105 places, 82 transitions, 220 flow [2020-10-09 16:48:09,055 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2020-10-09 16:48:09,055 INFO L341 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2020-10-09 16:48:09,056 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 220 flow [2020-10-09 16:48:09,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 16:48:09,056 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:48:09,056 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:48:09,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 16:48:09,278 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:48:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:48:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2039793601, now seen corresponding path program 3 times [2020-10-09 16:48:09,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:48:09,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368611966] [2020-10-09 16:48:09,280 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:48:09,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 16:48:09,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 16:48:09,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:48:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 16:48:09,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:48:09,687 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 16:48:09,688 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 16:48:09,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 16:48:09,956 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:48:09,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,957 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:48:09,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,958 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:48:09,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,958 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:48:09,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,959 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:48:09,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,960 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:48:09,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,961 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:48:09,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,961 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:48:09,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,961 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:48:09,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,962 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:48:09,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,962 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:48:09,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,963 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:48:09,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,963 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:48:09,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,964 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:48:09,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,965 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:48:09,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,965 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:48:09,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,966 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:48:09,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,966 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:48:09,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,970 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:48:09,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,971 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:48:09,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,972 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:48:09,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,972 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:48:09,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,972 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:48:09,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,973 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:48:09,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,974 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:48:09,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,974 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:48:09,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,975 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:48:09,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,975 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:48:09,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,975 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:48:09,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,976 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:48:09,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,976 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:48:09,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,976 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:48:09,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,977 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:48:09,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,977 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:48:09,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,977 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:48:09,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,977 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:48:09,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,978 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:48:09,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,978 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:48:09,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,979 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:48:09,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,979 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:48:09,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:09,979 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:48:09,980 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:48:10,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 04:48:10 BasicIcfg [2020-10-09 16:48:10,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 16:48:10,128 INFO L168 Benchmark]: Toolchain (without parser) took 13893.82 ms. Allocated memory was 251.1 MB in the beginning and 523.2 MB in the end (delta: 272.1 MB). Free memory was 205.7 MB in the beginning and 189.8 MB in the end (delta: 15.8 MB). Peak memory consumption was 287.9 MB. Max. memory is 14.2 GB. [2020-10-09 16:48:10,129 INFO L168 Benchmark]: CDTParser took 0.21 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:48:10,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.69 ms. Allocated memory was 251.1 MB in the beginning and 316.1 MB in the end (delta: 65.0 MB). Free memory was 205.7 MB in the beginning and 264.4 MB in the end (delta: -58.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. [2020-10-09 16:48:10,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 316.1 MB. Free memory was 264.4 MB in the beginning and 261.9 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:48:10,133 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 316.1 MB. Free memory was 261.9 MB in the beginning and 259.4 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:48:10,134 INFO L168 Benchmark]: RCFGBuilder took 2629.79 ms. Allocated memory was 316.1 MB in the beginning and 374.3 MB in the end (delta: 58.2 MB). Free memory was 259.4 MB in the beginning and 293.6 MB in the end (delta: -34.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 14.2 GB. [2020-10-09 16:48:10,137 INFO L168 Benchmark]: TraceAbstraction took 10434.97 ms. Allocated memory was 374.3 MB in the beginning and 523.2 MB in the end (delta: 148.9 MB). Free memory was 293.6 MB in the beginning and 189.8 MB in the end (delta: 103.8 MB). Peak memory consumption was 252.7 MB. Max. memory is 14.2 GB. [2020-10-09 16:48:10,144 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.21 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 711.69 ms. Allocated memory was 251.1 MB in the beginning and 316.1 MB in the end (delta: 65.0 MB). Free memory was 205.7 MB in the beginning and 264.4 MB in the end (delta: -58.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 316.1 MB. Free memory was 264.4 MB in the beginning and 261.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 316.1 MB. Free memory was 261.9 MB in the beginning and 259.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2629.79 ms. Allocated memory was 316.1 MB in the beginning and 374.3 MB in the end (delta: 58.2 MB). Free memory was 259.4 MB in the beginning and 293.6 MB in the end (delta: -34.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10434.97 ms. Allocated memory was 374.3 MB in the beginning and 523.2 MB in the end (delta: 148.9 MB). Free memory was 293.6 MB in the beginning and 189.8 MB in the end (delta: 103.8 MB). Peak memory consumption was 252.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L702] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L709] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L710] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L711] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L712] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L713] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L714] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L718] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L719] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L720] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L721] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L722] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L723] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L724] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] 0 pthread_t t766; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] 0 pthread_t t767; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] 0 pthread_t t768; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 y$flush_delayed = weak$$choice2 [L782] 3 y$mem_tmp = y [L783] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L783] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L783] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L784] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L784] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L785] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L785] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L785] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L786] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L787] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L787] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L788] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L789] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L789] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = y [L791] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L791] 3 y = y$flush_delayed ? y$mem_tmp : y [L792] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L753] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L802] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L831] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 y$flush_delayed = weak$$choice2 [L841] 0 y$mem_tmp = y [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L843] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L844] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L844] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L845] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L845] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L850] 0 y = y$flush_delayed ? y$mem_tmp : y [L851] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 278 SDslu, 692 SDs, 0 SdLazy, 616 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 889 GetRequests, 790 SyntacticMatches, 11 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 854 ConstructedInterpolants, 0 QuantifiedInterpolants, 223725 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1343 ConjunctsInSsa, 68 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...