/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 16:47:25,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 16:47:25,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 16:47:25,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 16:47:25,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 16:47:25,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 16:47:25,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 16:47:25,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 16:47:25,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 16:47:25,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 16:47:25,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 16:47:25,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 16:47:25,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 16:47:25,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 16:47:25,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 16:47:25,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 16:47:25,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 16:47:25,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 16:47:25,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 16:47:25,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 16:47:25,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 16:47:25,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 16:47:25,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 16:47:25,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 16:47:25,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 16:47:25,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 16:47:25,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 16:47:25,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 16:47:25,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 16:47:25,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 16:47:25,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 16:47:25,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 16:47:25,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 16:47:25,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 16:47:25,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 16:47:25,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 16:47:25,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 16:47:25,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 16:47:25,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 16:47:25,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 16:47:25,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 16:47:25,889 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:25,923 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 16:47:25,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 16:47:25,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 16:47:25,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 16:47:25,925 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 16:47:25,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 16:47:25,926 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 16:47:25,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 16:47:25,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 16:47:25,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 16:47:25,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 16:47:25,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 16:47:25,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 16:47:25,927 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 16:47:25,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 16:47:25,928 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 16:47:25,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 16:47:25,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 16:47:25,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 16:47:25,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 16:47:25,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 16:47:25,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 16:47:25,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 16:47:25,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 16:47:25,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 16:47:25,930 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 16:47:25,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 16:47:25,930 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 16:47:25,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 16:47:25,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 16:47:26,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 16:47:26,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 16:47:26,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 16:47:26,255 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 16:47:26,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 16:47:26,256 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2020-10-09 16:47:26,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa49c946/8c341276e76b438eb50d9ee7fc84451c/FLAG0411cd0e0 [2020-10-09 16:47:26,843 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 16:47:26,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.opt.i [2020-10-09 16:47:26,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa49c946/8c341276e76b438eb50d9ee7fc84451c/FLAG0411cd0e0 [2020-10-09 16:47:27,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa49c946/8c341276e76b438eb50d9ee7fc84451c [2020-10-09 16:47:27,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 16:47:27,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 16:47:27,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 16:47:27,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 16:47:27,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 16:47:27,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:47:27" (1/1) ... [2020-10-09 16:47:27,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644f593f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:27, skipping insertion in model container [2020-10-09 16:47:27,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:47:27" (1/1) ... [2020-10-09 16:47:27,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 16:47:27,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 16:47:27,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:47:27,827 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 16:47:27,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:47:27,966 INFO L208 MainTranslator]: Completed translation [2020-10-09 16:47:27,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:27 WrapperNode [2020-10-09 16:47:27,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 16:47:27,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 16:47:27,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 16:47:27,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 16:47:27,977 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:27" (1/1) ... [2020-10-09 16:47:28,005 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:27" (1/1) ... [2020-10-09 16:47:28,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 16:47:28,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 16:47:28,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 16:47:28,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 16:47:28,056 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:27" (1/1) ... [2020-10-09 16:47:28,056 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:27" (1/1) ... [2020-10-09 16:47:28,061 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:27" (1/1) ... [2020-10-09 16:47:28,062 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:27" (1/1) ... [2020-10-09 16:47:28,072 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:27" (1/1) ... [2020-10-09 16:47:28,077 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:27" (1/1) ... [2020-10-09 16:47:28,081 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:27" (1/1) ... [2020-10-09 16:47:28,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 16:47:28,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 16:47:28,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 16:47:28,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 16:47:28,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:27" (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:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 16:47:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 16:47:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 16:47:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 16:47:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 16:47:28,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 16:47:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 16:47:28,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 16:47:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 16:47:28,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 16:47:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 16:47:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 16:47:28,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 16:47:28,172 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:30,387 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 16:47:30,388 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 16:47:30,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:47:30 BoogieIcfgContainer [2020-10-09 16:47:30,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 16:47:30,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 16:47:30,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 16:47:30,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 16:47:30,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 04:47:27" (1/3) ... [2020-10-09 16:47:30,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1973044e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:47:30, skipping insertion in model container [2020-10-09 16:47:30,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:47:27" (2/3) ... [2020-10-09 16:47:30,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1973044e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:47:30, skipping insertion in model container [2020-10-09 16:47:30,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:47:30" (3/3) ... [2020-10-09 16:47:30,398 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_pso.opt.i [2020-10-09 16:47:30,410 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 16:47:30,418 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 16:47:30,419 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 16:47:30,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,454 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,454 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,455 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,459 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,459 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,461 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:47:30,500 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 16:47:30,523 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 16:47:30,523 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 16:47:30,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 16:47:30,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 16:47:30,524 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 16:47:30,524 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 16:47:30,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 16:47:30,524 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 16:47:30,539 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-09 16:47:30,588 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-09 16:47:30,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:47:30,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-09 16:47:30,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-09 16:47:30,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-09 16:47:30,616 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2020-10-09 16:47:30,616 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:47:30,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:30,618 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] [2020-10-09 16:47:30,618 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1570082113, now seen corresponding path program 1 times [2020-10-09 16:47:30,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:30,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259107561] [2020-10-09 16:47:30,640 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:47:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:30,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:47:30,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:30,856 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:47:30,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:30,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:30,935 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:47:30,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259107561] [2020-10-09 16:47:30,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:30,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 16:47:30,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375314419] [2020-10-09 16:47:30,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 16:47:30,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 16:47:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 16:47:31,109 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 94 [2020-10-09 16:47:31,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 191 flow. Second operand 4 states. [2020-10-09 16:47:31,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:31,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 94 [2020-10-09 16:47:31,113 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:31,147 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2020-10-09 16:47:31,147 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:47:31,148 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 88 events. 0/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 16:47:31,149 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 0 selfloop transitions, 2 changer transitions 11/88 dead transitions. [2020-10-09 16:47:31,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 88 transitions, 189 flow [2020-10-09 16:47:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 16:47:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 16:47:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2020-10-09 16:47:31,165 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9716312056737588 [2020-10-09 16:47:31,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2020-10-09 16:47:31,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2020-10-09 16:47:31,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:31,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2020-10-09 16:47:31,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 16:47:31,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 16:47:31,182 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 16:47:31,184 INFO L185 Difference]: Start difference. First operand has 99 places, 91 transitions, 191 flow. Second operand 3 states and 274 transitions. [2020-10-09 16:47:31,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 88 transitions, 189 flow [2020-10-09 16:47:31,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 88 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-09 16:47:31,193 INFO L241 Difference]: Finished difference. Result has 97 places, 77 transitions, 164 flow [2020-10-09 16:47:31,196 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2020-10-09 16:47:31,198 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2020-10-09 16:47:31,198 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 164 flow [2020-10-09 16:47:31,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 16:47:31,198 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:31,198 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:47:31,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 16:47:31,414 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash -647770408, now seen corresponding path program 1 times [2020-10-09 16:47:31,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:31,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496189007] [2020-10-09 16:47:31,417 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:47:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:31,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:47:31,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:31,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:31,592 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:47:31,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:31,666 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:47:31,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496189007] [2020-10-09 16:47:31,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:31,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:47:31,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844864775] [2020-10-09 16:47:31,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:47:31,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:47:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:47:31,831 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2020-10-09 16:47:31,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 164 flow. Second operand 8 states. [2020-10-09 16:47:31,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:31,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2020-10-09 16:47:31,832 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:31,938 INFO L129 PetriNetUnfolder]: 3/103 cut-off events. [2020-10-09 16:47:31,938 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:47:31,939 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 103 events. 3/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 146 event pairs, 0 based on Foata normal form. 2/105 useless extension candidates. Maximal degree in co-relation 97. Up to 7 conditions per place. [2020-10-09 16:47:31,940 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 6 selfloop transitions, 2 changer transitions 10/87 dead transitions. [2020-10-09 16:47:31,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 220 flow [2020-10-09 16:47:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:47:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:47:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 776 transitions. [2020-10-09 16:47:31,945 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.91725768321513 [2020-10-09 16:47:31,946 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 776 transitions. [2020-10-09 16:47:31,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 776 transitions. [2020-10-09 16:47:31,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:31,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 776 transitions. [2020-10-09 16:47:31,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:47:31,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:47:31,952 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:47:31,952 INFO L185 Difference]: Start difference. First operand has 97 places, 77 transitions, 164 flow. Second operand 9 states and 776 transitions. [2020-10-09 16:47:31,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 220 flow [2020-10-09 16:47:31,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 16:47:31,956 INFO L241 Difference]: Finished difference. Result has 99 places, 77 transitions, 180 flow [2020-10-09 16:47:31,957 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=99, PETRI_TRANSITIONS=77} [2020-10-09 16:47:31,957 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2020-10-09 16:47:31,957 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 77 transitions, 180 flow [2020-10-09 16:47:31,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:47:31,958 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:31,958 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:32,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 16:47:32,171 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1803617102, now seen corresponding path program 1 times [2020-10-09 16:47:32,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:32,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603096495] [2020-10-09 16:47:32,173 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:47:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:32,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 16:47:32,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:32,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:47:32,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:47:32,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 16:47:32,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:47:32,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:32,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:32,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:32,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:32,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:32,647 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:47:32,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:32,697 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-10-09 16:47:32,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-09 16:47:32,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-09 16:47:32,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,804 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-10-09 16:47:32,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,806 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 2, 2, 1] term [2020-10-09 16:47:32,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,808 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 3, 2, 1] term [2020-10-09 16:47:32,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:32,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:32,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:32,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:32,907 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:47:32,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603096495] [2020-10-09 16:47:32,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:32,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 14 [2020-10-09 16:47:32,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949971301] [2020-10-09 16:47:32,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 16:47:32,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 16:47:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-09 16:47:33,383 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 94 [2020-10-09 16:47:33,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 77 transitions, 180 flow. Second operand 14 states. [2020-10-09 16:47:33,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:33,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 94 [2020-10-09 16:47:33,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:34,323 INFO L129 PetriNetUnfolder]: 365/783 cut-off events. [2020-10-09 16:47:34,323 INFO L130 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2020-10-09 16:47:34,328 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 783 events. 365/783 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4249 event pairs, 31 based on Foata normal form. 24/793 useless extension candidates. Maximal degree in co-relation 1563. Up to 263 conditions per place. [2020-10-09 16:47:34,332 INFO L132 encePairwiseOnDemand]: 80/94 looper letters, 20 selfloop transitions, 23 changer transitions 71/174 dead transitions. [2020-10-09 16:47:34,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 174 transitions, 662 flow [2020-10-09 16:47:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-09 16:47:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-09 16:47:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1895 transitions. [2020-10-09 16:47:34,339 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8399822695035462 [2020-10-09 16:47:34,339 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1895 transitions. [2020-10-09 16:47:34,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1895 transitions. [2020-10-09 16:47:34,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:34,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1895 transitions. [2020-10-09 16:47:34,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 25 states. [2020-10-09 16:47:34,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 25 states. [2020-10-09 16:47:34,348 INFO L81 ComplementDD]: Finished complementDD. Result 25 states. [2020-10-09 16:47:34,348 INFO L185 Difference]: Start difference. First operand has 99 places, 77 transitions, 180 flow. Second operand 24 states and 1895 transitions. [2020-10-09 16:47:34,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 174 transitions, 662 flow [2020-10-09 16:47:34,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 174 transitions, 594 flow, removed 32 selfloop flow, removed 8 redundant places. [2020-10-09 16:47:34,358 INFO L241 Difference]: Finished difference. Result has 124 places, 98 transitions, 318 flow [2020-10-09 16:47:34,358 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=318, PETRI_PLACES=124, PETRI_TRANSITIONS=98} [2020-10-09 16:47:34,359 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 25 predicate places. [2020-10-09 16:47:34,359 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 98 transitions, 318 flow [2020-10-09 16:47:34,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 16:47:34,359 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:34,359 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:34,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 16:47:34,570 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash 18451534, now seen corresponding path program 1 times [2020-10-09 16:47:34,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:34,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879125380] [2020-10-09 16:47:34,572 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:47:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:34,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-09 16:47:34,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:34,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:47:34,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:47:34,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:34,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:34,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:34,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:34,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 16:47:34,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 16:47:34,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-09 16:47:34,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,926 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-09 16:47:34,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:34,998 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:47:34,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:35,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 16:47:35,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-10-09 16:47:35,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,054 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 2, 1] term [2020-10-09 16:47:35,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-09 16:47:35,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,066 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-09 16:47:35,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,216 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-10-09 16:47:35,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-09 16:47:35,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-09 16:47:35,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 2, 1] term [2020-10-09 16:47:35,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,229 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:47:35,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:47:35,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:47:35,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,282 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:47:35,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,304 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:47:35,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,319 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:47:35,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,352 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:47:35,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,399 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-09 16:47:35,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,436 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:47:35,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,441 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 16:47:35,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,447 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:47:35,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 3, 3, 2, 1] term [2020-10-09 16:47:35,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,469 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-09 16:47:35,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-09 16:47:35,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,534 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-09 16:47:35,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-09 16:47:35,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,582 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-09 16:47:35,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:47:35,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 16:47:35,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:47:35,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:47:35,771 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:47:35,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:47:35,842 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:47:35,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879125380] [2020-10-09 16:47:35,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:35,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2020-10-09 16:47:35,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537391122] [2020-10-09 16:47:35,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-09 16:47:35,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-09 16:47:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-09 16:47:36,725 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2020-10-09 16:47:36,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 98 transitions, 318 flow. Second operand 16 states. [2020-10-09 16:47:36,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:36,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2020-10-09 16:47:36,727 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:37,813 INFO L129 PetriNetUnfolder]: 318/753 cut-off events. [2020-10-09 16:47:37,813 INFO L130 PetriNetUnfolder]: For 1860/2084 co-relation queries the response was YES. [2020-10-09 16:47:37,818 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 753 events. 318/753 cut-off events. For 1860/2084 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4086 event pairs, 17 based on Foata normal form. 72/813 useless extension candidates. Maximal degree in co-relation 2348. Up to 283 conditions per place. [2020-10-09 16:47:37,823 INFO L132 encePairwiseOnDemand]: 79/94 looper letters, 27 selfloop transitions, 31 changer transitions 67/183 dead transitions. [2020-10-09 16:47:37,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 183 transitions, 1075 flow [2020-10-09 16:47:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-09 16:47:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-09 16:47:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1761 transitions. [2020-10-09 16:47:37,829 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8145235892691952 [2020-10-09 16:47:37,830 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1761 transitions. [2020-10-09 16:47:37,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1761 transitions. [2020-10-09 16:47:37,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:37,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1761 transitions. [2020-10-09 16:47:37,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-09 16:47:37,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-09 16:47:37,838 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-09 16:47:37,839 INFO L185 Difference]: Start difference. First operand has 124 places, 98 transitions, 318 flow. Second operand 23 states and 1761 transitions. [2020-10-09 16:47:37,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 183 transitions, 1075 flow [2020-10-09 16:47:37,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 959 flow, removed 56 selfloop flow, removed 14 redundant places. [2020-10-09 16:47:37,849 INFO L241 Difference]: Finished difference. Result has 132 places, 111 transitions, 486 flow [2020-10-09 16:47:37,850 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=486, PETRI_PLACES=132, PETRI_TRANSITIONS=111} [2020-10-09 16:47:37,850 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 33 predicate places. [2020-10-09 16:47:37,850 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 111 transitions, 486 flow [2020-10-09 16:47:37,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-09 16:47:37,850 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:37,850 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:38,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 16:47:38,063 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1099366829, now seen corresponding path program 1 times [2020-10-09 16:47:38,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:38,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023826872] [2020-10-09 16:47:38,065 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:47:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:38,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:47:38,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:38,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:38,218 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:47:38,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:38,251 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:47:38,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023826872] [2020-10-09 16:47:38,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:38,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:47:38,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997038591] [2020-10-09 16:47:38,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:47:38,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:47:38,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:47:38,395 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 94 [2020-10-09 16:47:38,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 111 transitions, 486 flow. Second operand 8 states. [2020-10-09 16:47:38,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:38,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 94 [2020-10-09 16:47:38,397 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:38,597 INFO L129 PetriNetUnfolder]: 190/709 cut-off events. [2020-10-09 16:47:38,597 INFO L130 PetriNetUnfolder]: For 2294/2343 co-relation queries the response was YES. [2020-10-09 16:47:38,604 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 709 events. 190/709 cut-off events. For 2294/2343 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4699 event pairs, 36 based on Foata normal form. 31/708 useless extension candidates. Maximal degree in co-relation 2272. Up to 221 conditions per place. [2020-10-09 16:47:38,609 INFO L132 encePairwiseOnDemand]: 87/94 looper letters, 12 selfloop transitions, 3 changer transitions 5/121 dead transitions. [2020-10-09 16:47:38,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 612 flow [2020-10-09 16:47:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 16:47:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-09 16:47:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2020-10-09 16:47:38,611 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2020-10-09 16:47:38,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2020-10-09 16:47:38,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2020-10-09 16:47:38,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:38,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2020-10-09 16:47:38,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-09 16:47:38,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-09 16:47:38,614 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-09 16:47:38,615 INFO L185 Difference]: Start difference. First operand has 132 places, 111 transitions, 486 flow. Second operand 6 states and 517 transitions. [2020-10-09 16:47:38,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 612 flow [2020-10-09 16:47:38,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 121 transitions, 518 flow, removed 38 selfloop flow, removed 18 redundant places. [2020-10-09 16:47:38,626 INFO L241 Difference]: Finished difference. Result has 112 places, 112 transitions, 458 flow [2020-10-09 16:47:38,626 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=458, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2020-10-09 16:47:38,626 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 13 predicate places. [2020-10-09 16:47:38,627 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 458 flow [2020-10-09 16:47:38,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:47:38,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:38,627 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:38,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 16:47:38,848 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash 598435157, now seen corresponding path program 2 times [2020-10-09 16:47:38,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:38,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126467828] [2020-10-09 16:47:38,851 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 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:47:38,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 16:47:38,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 16:47:38,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 16:47:38,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:38,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:38,977 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:47:38,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:39,002 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:47:39,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126467828] [2020-10-09 16:47:39,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:39,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:47:39,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710476143] [2020-10-09 16:47:39,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:47:39,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:39,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:47:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:47:39,135 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 94 [2020-10-09 16:47:39,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 458 flow. Second operand 8 states. [2020-10-09 16:47:39,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:39,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 94 [2020-10-09 16:47:39,136 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:39,415 INFO L129 PetriNetUnfolder]: 369/1074 cut-off events. [2020-10-09 16:47:39,415 INFO L130 PetriNetUnfolder]: For 286/308 co-relation queries the response was YES. [2020-10-09 16:47:39,422 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 1074 events. 369/1074 cut-off events. For 286/308 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8034 event pairs, 12 based on Foata normal form. 49/1045 useless extension candidates. Maximal degree in co-relation 2057. Up to 142 conditions per place. [2020-10-09 16:47:39,427 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 15 selfloop transitions, 27 changer transitions 9/136 dead transitions. [2020-10-09 16:47:39,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 136 transitions, 543 flow [2020-10-09 16:47:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 16:47:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 16:47:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1023 transitions. [2020-10-09 16:47:39,432 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9069148936170213 [2020-10-09 16:47:39,433 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1023 transitions. [2020-10-09 16:47:39,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1023 transitions. [2020-10-09 16:47:39,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:39,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1023 transitions. [2020-10-09 16:47:39,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 16:47:39,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 16:47:39,439 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 16:47:39,439 INFO L185 Difference]: Start difference. First operand has 112 places, 112 transitions, 458 flow. Second operand 12 states and 1023 transitions. [2020-10-09 16:47:39,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 136 transitions, 543 flow [2020-10-09 16:47:39,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 136 transitions, 519 flow, removed 4 selfloop flow, removed 7 redundant places. [2020-10-09 16:47:39,445 INFO L241 Difference]: Finished difference. Result has 116 places, 123 transitions, 483 flow [2020-10-09 16:47:39,445 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=483, PETRI_PLACES=116, PETRI_TRANSITIONS=123} [2020-10-09 16:47:39,445 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 17 predicate places. [2020-10-09 16:47:39,446 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 483 flow [2020-10-09 16:47:39,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:47:39,446 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:39,446 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:47:39,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 16:47:39,661 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash -628991382, now seen corresponding path program 1 times [2020-10-09 16:47:39,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:39,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909184338] [2020-10-09 16:47:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:47:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:39,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 16:47:39,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:39,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:39,816 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:47:39,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:39,855 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:47:39,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909184338] [2020-10-09 16:47:39,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:39,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-09 16:47:39,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749943174] [2020-10-09 16:47:39,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 16:47:39,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 16:47:39,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 16:47:40,060 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 94 [2020-10-09 16:47:40,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 123 transitions, 483 flow. Second operand 10 states. [2020-10-09 16:47:40,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:40,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 94 [2020-10-09 16:47:40,061 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:40,403 INFO L129 PetriNetUnfolder]: 297/934 cut-off events. [2020-10-09 16:47:40,403 INFO L130 PetriNetUnfolder]: For 528/1309 co-relation queries the response was YES. [2020-10-09 16:47:40,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 934 events. 297/934 cut-off events. For 528/1309 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 7151 event pairs, 4 based on Foata normal form. 275/1135 useless extension candidates. Maximal degree in co-relation 2216. Up to 124 conditions per place. [2020-10-09 16:47:40,415 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 10 selfloop transitions, 32 changer transitions 14/139 dead transitions. [2020-10-09 16:47:40,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 642 flow [2020-10-09 16:47:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-09 16:47:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-09 16:47:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1266 transitions. [2020-10-09 16:47:40,421 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8978723404255319 [2020-10-09 16:47:40,422 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1266 transitions. [2020-10-09 16:47:40,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1266 transitions. [2020-10-09 16:47:40,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:40,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1266 transitions. [2020-10-09 16:47:40,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-09 16:47:40,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-09 16:47:40,430 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-09 16:47:40,430 INFO L185 Difference]: Start difference. First operand has 116 places, 123 transitions, 483 flow. Second operand 15 states and 1266 transitions. [2020-10-09 16:47:40,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 642 flow [2020-10-09 16:47:40,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 139 transitions, 600 flow, removed 12 selfloop flow, removed 7 redundant places. [2020-10-09 16:47:40,438 INFO L241 Difference]: Finished difference. Result has 129 places, 121 transitions, 524 flow [2020-10-09 16:47:40,438 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=524, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2020-10-09 16:47:40,438 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 30 predicate places. [2020-10-09 16:47:40,439 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 524 flow [2020-10-09 16:47:40,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 16:47:40,439 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:40,439 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:40,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 16:47:40,654 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1503189280, now seen corresponding path program 1 times [2020-10-09 16:47:40,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:40,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414982403] [2020-10-09 16:47:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:47:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:47:40,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:47:40,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:47:40,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:47:40,874 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:47:40,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:47:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 16:47:40,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414982403] [2020-10-09 16:47:40,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:47:40,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 16:47:40,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456951572] [2020-10-09 16:47:40,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 16:47:40,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:47:40,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 16:47:40,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 16:47:41,157 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2020-10-09 16:47:41,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 524 flow. Second operand 9 states. [2020-10-09 16:47:41,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:47:41,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2020-10-09 16:47:41,159 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:47:41,397 INFO L129 PetriNetUnfolder]: 338/1235 cut-off events. [2020-10-09 16:47:41,397 INFO L130 PetriNetUnfolder]: For 1318/1348 co-relation queries the response was YES. [2020-10-09 16:47:41,404 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 1235 events. 338/1235 cut-off events. For 1318/1348 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 11097 event pairs, 8 based on Foata normal form. 3/1156 useless extension candidates. Maximal degree in co-relation 3029. Up to 144 conditions per place. [2020-10-09 16:47:41,407 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 9 selfloop transitions, 2 changer transitions 13/126 dead transitions. [2020-10-09 16:47:41,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 126 transitions, 566 flow [2020-10-09 16:47:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 16:47:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 16:47:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2020-10-09 16:47:41,409 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8966565349544073 [2020-10-09 16:47:41,409 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions. [2020-10-09 16:47:41,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions. [2020-10-09 16:47:41,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:47:41,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions. [2020-10-09 16:47:41,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 16:47:41,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 16:47:41,413 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 16:47:41,413 INFO L185 Difference]: Start difference. First operand has 129 places, 121 transitions, 524 flow. Second operand 7 states and 590 transitions. [2020-10-09 16:47:41,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 126 transitions, 566 flow [2020-10-09 16:47:41,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 507 flow, removed 5 selfloop flow, removed 12 redundant places. [2020-10-09 16:47:41,437 INFO L241 Difference]: Finished difference. Result has 126 places, 113 transitions, 441 flow [2020-10-09 16:47:41,437 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=441, PETRI_PLACES=126, PETRI_TRANSITIONS=113} [2020-10-09 16:47:41,437 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 27 predicate places. [2020-10-09 16:47:41,437 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 441 flow [2020-10-09 16:47:41,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 16:47:41,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:47:41,438 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:47:41,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 16:47:41,647 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:47:41,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:47:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1339755250, now seen corresponding path program 2 times [2020-10-09 16:47:41,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:47:41,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073413226] [2020-10-09 16:47:41,655 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 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 16:47:41,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 16:47:41,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 16:47:41,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:47:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 16:47:41,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:47:41,930 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 16:47:41,930 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 16:47:42,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 16:47:42,173 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:47:42,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,174 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:47:42,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,175 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:47:42,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,175 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:47:42,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,176 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:47:42,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,176 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:47:42,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,176 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:47:42,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,177 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:47:42,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,177 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:47:42,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,177 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:47:42,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,178 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:47:42,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,178 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:47:42,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,179 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:47:42,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,179 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:47:42,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,180 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:47:42,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,180 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:47:42,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,180 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:47:42,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,182 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:47:42,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,182 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:47:42,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,182 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:47:42,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,183 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:47:42,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,183 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:47:42,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,183 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:47:42,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,184 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:47:42,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,184 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:47:42,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,184 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:47:42,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,185 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:47:42,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,185 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:47:42,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,185 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:47:42,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,186 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:47:42,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,186 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:47:42,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,186 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:47:42,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,187 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:47:42,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,187 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:47:42,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,187 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:47:42,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:47:42,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 04:47:42 BasicIcfg [2020-10-09 16:47:42,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 16:47:42,296 INFO L168 Benchmark]: Toolchain (without parser) took 15088.78 ms. Allocated memory was 249.6 MB in the beginning and 570.4 MB in the end (delta: 320.9 MB). Free memory was 204.6 MB in the beginning and 385.9 MB in the end (delta: -181.2 MB). Peak memory consumption was 139.6 MB. Max. memory is 14.2 GB. [2020-10-09 16:47:42,297 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-09 16:47:42,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.21 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.6 MB in the beginning and 259.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 14.2 GB. [2020-10-09 16:47:42,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.17 ms. Allocated memory is still 308.8 MB. Free memory was 259.4 MB in the beginning and 256.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-09 16:47:42,300 INFO L168 Benchmark]: Boogie Preprocessor took 40.23 ms. Allocated memory is still 308.8 MB. Free memory was 256.1 MB in the beginning and 253.6 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:47:42,302 INFO L168 Benchmark]: RCFGBuilder took 2303.26 ms. Allocated memory was 308.8 MB in the beginning and 357.0 MB in the end (delta: 48.2 MB). Free memory was 253.6 MB in the beginning and 184.2 MB in the end (delta: 69.4 MB). Peak memory consumption was 117.6 MB. Max. memory is 14.2 GB. [2020-10-09 16:47:42,303 INFO L168 Benchmark]: TraceAbstraction took 11902.67 ms. Allocated memory was 357.0 MB in the beginning and 570.4 MB in the end (delta: 213.4 MB). Free memory was 184.2 MB in the beginning and 385.9 MB in the end (delta: -201.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 14.2 GB. [2020-10-09 16:47:42,311 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.22 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 759.21 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.6 MB in the beginning and 259.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 78.17 ms. Allocated memory is still 308.8 MB. Free memory was 259.4 MB in the beginning and 256.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.23 ms. Allocated memory is still 308.8 MB. Free memory was 256.1 MB in the beginning and 253.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2303.26 ms. Allocated memory was 308.8 MB in the beginning and 357.0 MB in the end (delta: 48.2 MB). Free memory was 253.6 MB in the beginning and 184.2 MB in the end (delta: 69.4 MB). Peak memory consumption was 117.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11902.67 ms. Allocated memory was 357.0 MB in the beginning and 570.4 MB in the end (delta: 213.4 MB). Free memory was 184.2 MB in the beginning and 385.9 MB in the end (delta: -201.7 MB). Peak memory consumption was 11.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] [L707] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L708] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L709] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L710] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L711] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L712] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L713] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L717] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L718] 0 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L720] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L721] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L722] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] 0 pthread_t t754; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L813] FCALL, FORK 0 pthread_create(&t754, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] 0 pthread_t t755; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L815] FCALL, FORK 0 pthread_create(&t755, ((void *)0), P1, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L816] 0 pthread_t t756; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L817] FCALL, FORK 0 pthread_create(&t756, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L784] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L787] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, 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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, 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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L774] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L790] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L791] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L792] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L793] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L794] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L797] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L819] 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L827] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 x$flush_delayed = weak$$choice2 [L833] 0 x$mem_tmp = x [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L834] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L835] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L835] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L836] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L836] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L836] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L837] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L837] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L839] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L842] 0 x = x$flush_delayed ? x$mem_tmp : x [L843] 0 x$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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 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: 11.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 404 SDslu, 718 SDs, 0 SdLazy, 829 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 994 GetRequests, 858 SyntacticMatches, 13 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 932 ConstructedInterpolants, 0 QuantifiedInterpolants, 223228 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1418 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...