./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:49:13,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:49:13,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:49:13,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:49:13,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:49:13,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:49:13,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:49:13,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:49:13,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:49:13,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:49:13,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:49:13,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:49:13,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:49:13,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:49:13,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:49:13,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:49:13,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:49:13,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:49:13,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:49:13,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:49:13,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:49:13,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:49:13,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:49:13,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:49:13,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:49:13,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:49:13,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:49:13,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:49:13,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:49:13,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:49:13,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:49:13,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:49:13,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:49:13,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:49:13,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:49:13,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:49:13,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:49:13,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:49:13,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:49:13,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:49:13,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:49:13,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 05:49:13,296 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:49:13,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:49:13,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:49:13,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:49:13,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:49:13,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:49:13,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:49:13,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:49:13,303 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:49:13,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:49:13,305 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:49:13,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:49:13,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:49:13,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:49:13,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 05:49:13,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:49:13,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 05:49:13,307 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:49:13,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:49:13,308 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:49:13,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 05:49:13,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:49:13,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:49:13,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:49:13,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:49:13,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:49:13,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:49:13,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 05:49:13,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:49:13,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:49:13,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 05:49:13,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 05:49:13,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 05:49:13,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:49:13,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef [2021-11-20 05:49:13,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:49:13,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:49:13,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:49:13,713 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:49:13,714 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:49:13,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2021-11-20 05:49:13,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/data/b4c3692cd/4c40d3e9f3604094832b07f08983f07a/FLAG6c358355f [2021-11-20 05:49:14,522 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:49:14,522 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i [2021-11-20 05:49:14,546 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/data/b4c3692cd/4c40d3e9f3604094832b07f08983f07a/FLAG6c358355f [2021-11-20 05:49:14,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/data/b4c3692cd/4c40d3e9f3604094832b07f08983f07a [2021-11-20 05:49:14,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:49:14,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:49:14,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:49:14,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:49:14,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:49:14,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:14" (1/1) ... [2021-11-20 05:49:14,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a08c6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:14, skipping insertion in model container [2021-11-20 05:49:14,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:14" (1/1) ... [2021-11-20 05:49:14,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:49:14,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:49:15,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2021-11-20 05:49:15,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:49:15,458 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:49:15,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/sv-benchmarks/c/pthread-wmm/mix011_tso.oepc.i[949,962] [2021-11-20 05:49:15,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:49:15,613 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:49:15,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15 WrapperNode [2021-11-20 05:49:15,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:49:15,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:49:15,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:49:15,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:49:15,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,703 INFO L137 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 284 [2021-11-20 05:49:15,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:49:15,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:49:15,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:49:15,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:49:15,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:49:15,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:49:15,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:49:15,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:49:15,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (1/1) ... [2021-11-20 05:49:15,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:49:15,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:49:15,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:49:15,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 05:49:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-20 05:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 05:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 05:49:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-20 05:49:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-20 05:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-20 05:49:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-20 05:49:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-20 05:49:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-20 05:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 05:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-20 05:49:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:49:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:49:15,879 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 05:49:16,063 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:49:16,065 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:49:16,839 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:49:17,367 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:49:17,368 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 05:49:17,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:17 BoogieIcfgContainer [2021-11-20 05:49:17,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:49:17,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:49:17,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:49:17,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:49:17,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:49:14" (1/3) ... [2021-11-20 05:49:17,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dfce26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:17, skipping insertion in model container [2021-11-20 05:49:17,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:15" (2/3) ... [2021-11-20 05:49:17,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dfce26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:17, skipping insertion in model container [2021-11-20 05:49:17,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:17" (3/3) ... [2021-11-20 05:49:17,385 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2021-11-20 05:49:17,393 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 05:49:17,393 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:49:17,393 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 05:49:17,393 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 05:49:17,450 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,450 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,451 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,451 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,451 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,452 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,452 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,452 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,453 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,453 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,455 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,456 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,457 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,457 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,457 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,458 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,458 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,459 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,460 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,461 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,461 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,461 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,462 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,463 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,463 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,463 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,463 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,464 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,464 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,464 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,464 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,465 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,465 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,465 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,465 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,466 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,466 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,466 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,467 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,467 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,467 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,468 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,468 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,469 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,469 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,469 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,470 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,470 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,470 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,470 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,471 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,471 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,471 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,472 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,472 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,472 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,473 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,474 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,474 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,474 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,474 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,475 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,475 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,475 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,476 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,477 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,478 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,478 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,478 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,478 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,479 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,479 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,479 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,480 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,481 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,481 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,486 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,486 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,487 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,487 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,490 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,491 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,491 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,492 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,492 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,492 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,492 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,495 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,495 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,496 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,496 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,496 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,496 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,497 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,497 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,497 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,497 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,498 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,499 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,500 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,500 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,500 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,500 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:49:17,501 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-20 05:49:17,563 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:49:17,571 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 05:49:17,572 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-20 05:49:17,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2021-11-20 05:49:17,710 INFO L129 PetriNetUnfolder]: 2/118 cut-off events. [2021-11-20 05:49:17,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 05:49:17,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-11-20 05:49:17,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2021-11-20 05:49:17,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2021-11-20 05:49:17,754 INFO L129 PetriNetUnfolder]: 0/62 cut-off events. [2021-11-20 05:49:17,754 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 05:49:17,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:17,755 INFO L254 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] [2021-11-20 05:49:17,756 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1939488338, now seen corresponding path program 1 times [2021-11-20 05:49:17,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:17,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708159164] [2021-11-20 05:49:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:17,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:18,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:18,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708159164] [2021-11-20 05:49:18,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708159164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:18,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:18,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 05:49:18,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950385568] [2021-11-20 05:49:18,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:18,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 05:49:18,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:18,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 05:49:18,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 05:49:18,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2021-11-20 05:49:18,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:18,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:18,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2021-11-20 05:49:18,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:18,648 INFO L129 PetriNetUnfolder]: 57/492 cut-off events. [2021-11-20 05:49:18,648 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-11-20 05:49:18,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 492 events. 57/492 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2537 event pairs, 31 based on Foata normal form. 18/480 useless extension candidates. Maximal degree in co-relation 562. Up to 75 conditions per place. [2021-11-20 05:49:18,662 INFO L132 encePairwiseOnDemand]: 116/121 looper letters, 13 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2021-11-20 05:49:18,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 119 transitions, 280 flow [2021-11-20 05:49:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 05:49:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 05:49:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2021-11-20 05:49:18,690 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2021-11-20 05:49:18,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2021-11-20 05:49:18,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2021-11-20 05:49:18,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:18,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2021-11-20 05:49:18,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:18,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:18,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:18,723 INFO L186 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 341 transitions. [2021-11-20 05:49:18,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 119 transitions, 280 flow [2021-11-20 05:49:18,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 276 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-20 05:49:18,736 INFO L242 Difference]: Finished difference. Result has 123 places, 114 transitions, 238 flow [2021-11-20 05:49:18,739 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2021-11-20 05:49:18,755 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2021-11-20 05:49:18,756 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 238 flow [2021-11-20 05:49:18,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:18,757 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:18,757 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:18,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 05:49:18,758 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1478602898, now seen corresponding path program 1 times [2021-11-20 05:49:18,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:18,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341229047] [2021-11-20 05:49:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:18,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:19,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:19,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341229047] [2021-11-20 05:49:19,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341229047] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:19,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:19,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:49:19,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20440651] [2021-11-20 05:49:19,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:19,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:19,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:49:19,162 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 121 [2021-11-20 05:49:19,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:19,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:19,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 121 [2021-11-20 05:49:19,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:19,731 INFO L129 PetriNetUnfolder]: 256/893 cut-off events. [2021-11-20 05:49:19,731 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-11-20 05:49:19,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 893 events. 256/893 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5772 event pairs, 82 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1322. Up to 171 conditions per place. [2021-11-20 05:49:19,741 INFO L132 encePairwiseOnDemand]: 115/121 looper letters, 18 selfloop transitions, 2 changer transitions 42/148 dead transitions. [2021-11-20 05:49:19,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 416 flow [2021-11-20 05:49:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 05:49:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 05:49:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 953 transitions. [2021-11-20 05:49:19,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751147842056933 [2021-11-20 05:49:19,754 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 953 transitions. [2021-11-20 05:49:19,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 953 transitions. [2021-11-20 05:49:19,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:19,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 953 transitions. [2021-11-20 05:49:19,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:19,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:19,767 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:19,767 INFO L186 Difference]: Start difference. First operand has 123 places, 114 transitions, 238 flow. Second operand 9 states and 953 transitions. [2021-11-20 05:49:19,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 416 flow [2021-11-20 05:49:19,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 148 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-20 05:49:19,777 INFO L242 Difference]: Finished difference. Result has 136 places, 102 transitions, 230 flow [2021-11-20 05:49:19,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=230, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2021-11-20 05:49:19,778 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 10 predicate places. [2021-11-20 05:49:19,779 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 230 flow [2021-11-20 05:49:19,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:19,780 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:19,780 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:19,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 05:49:19,781 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash 455179317, now seen corresponding path program 1 times [2021-11-20 05:49:19,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:19,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292810391] [2021-11-20 05:49:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:19,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:20,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:20,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292810391] [2021-11-20 05:49:20,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292810391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:20,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:20,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 05:49:20,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808817250] [2021-11-20 05:49:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:20,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 05:49:20,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 05:49:20,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-20 05:49:20,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 121 [2021-11-20 05:49:20,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 102 transitions, 230 flow. Second operand has 11 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:20,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:20,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 121 [2021-11-20 05:49:20,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:21,017 INFO L129 PetriNetUnfolder]: 234/646 cut-off events. [2021-11-20 05:49:21,017 INFO L130 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2021-11-20 05:49:21,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 646 events. 234/646 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3555 event pairs, 99 based on Foata normal form. 12/642 useless extension candidates. Maximal degree in co-relation 1167. Up to 269 conditions per place. [2021-11-20 05:49:21,026 INFO L132 encePairwiseOnDemand]: 108/121 looper letters, 21 selfloop transitions, 11 changer transitions 28/141 dead transitions. [2021-11-20 05:49:21,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 141 transitions, 452 flow [2021-11-20 05:49:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 05:49:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-20 05:49:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1297 transitions. [2021-11-20 05:49:21,032 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.82453909726637 [2021-11-20 05:49:21,033 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1297 transitions. [2021-11-20 05:49:21,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1297 transitions. [2021-11-20 05:49:21,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:21,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1297 transitions. [2021-11-20 05:49:21,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.76923076923077) internal successors, (1297), 13 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,048 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,048 INFO L186 Difference]: Start difference. First operand has 136 places, 102 transitions, 230 flow. Second operand 13 states and 1297 transitions. [2021-11-20 05:49:21,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 141 transitions, 452 flow [2021-11-20 05:49:21,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 141 transitions, 420 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-11-20 05:49:21,060 INFO L242 Difference]: Finished difference. Result has 130 places, 109 transitions, 289 flow [2021-11-20 05:49:21,060 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=289, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2021-11-20 05:49:21,061 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2021-11-20 05:49:21,062 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 289 flow [2021-11-20 05:49:21,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,063 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:21,064 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:21,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 05:49:21,064 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1927075023, now seen corresponding path program 2 times [2021-11-20 05:49:21,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:21,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491659285] [2021-11-20 05:49:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:21,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:21,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:21,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491659285] [2021-11-20 05:49:21,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491659285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:21,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:21,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:49:21,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095065413] [2021-11-20 05:49:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:21,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:21,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:49:21,278 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 121 [2021-11-20 05:49:21,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 109 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:21,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 121 [2021-11-20 05:49:21,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:21,710 INFO L129 PetriNetUnfolder]: 267/728 cut-off events. [2021-11-20 05:49:21,710 INFO L130 PetriNetUnfolder]: For 977/1060 co-relation queries the response was YES. [2021-11-20 05:49:21,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 728 events. 267/728 cut-off events. For 977/1060 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3972 event pairs, 45 based on Foata normal form. 18/723 useless extension candidates. Maximal degree in co-relation 1831. Up to 233 conditions per place. [2021-11-20 05:49:21,720 INFO L132 encePairwiseOnDemand]: 115/121 looper letters, 34 selfloop transitions, 10 changer transitions 9/141 dead transitions. [2021-11-20 05:49:21,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 141 transitions, 555 flow [2021-11-20 05:49:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 05:49:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 05:49:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 947 transitions. [2021-11-20 05:49:21,725 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.869605142332415 [2021-11-20 05:49:21,725 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 947 transitions. [2021-11-20 05:49:21,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 947 transitions. [2021-11-20 05:49:21,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:21,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 947 transitions. [2021-11-20 05:49:21,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,734 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,734 INFO L186 Difference]: Start difference. First operand has 130 places, 109 transitions, 289 flow. Second operand 9 states and 947 transitions. [2021-11-20 05:49:21,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 141 transitions, 555 flow [2021-11-20 05:49:21,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 141 transitions, 535 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-11-20 05:49:21,746 INFO L242 Difference]: Finished difference. Result has 129 places, 117 transitions, 342 flow [2021-11-20 05:49:21,746 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=342, PETRI_PLACES=129, PETRI_TRANSITIONS=117} [2021-11-20 05:49:21,748 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 3 predicate places. [2021-11-20 05:49:21,748 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 117 transitions, 342 flow [2021-11-20 05:49:21,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:21,749 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:21,749 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:21,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 05:49:21,750 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1802715314, now seen corresponding path program 1 times [2021-11-20 05:49:21,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:21,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067678376] [2021-11-20 05:49:21,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:21,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:22,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067678376] [2021-11-20 05:49:22,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067678376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:22,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:22,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-20 05:49:22,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154102553] [2021-11-20 05:49:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:22,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 05:49:22,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 05:49:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-20 05:49:22,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2021-11-20 05:49:22,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 117 transitions, 342 flow. Second operand has 12 states, 12 states have (on average 95.5) internal successors, (1146), 12 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:22,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:22,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2021-11-20 05:49:22,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:22,816 INFO L129 PetriNetUnfolder]: 401/1002 cut-off events. [2021-11-20 05:49:22,816 INFO L130 PetriNetUnfolder]: For 1577/1625 co-relation queries the response was YES. [2021-11-20 05:49:22,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1002 events. 401/1002 cut-off events. For 1577/1625 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6127 event pairs, 166 based on Foata normal form. 18/1001 useless extension candidates. Maximal degree in co-relation 2713. Up to 372 conditions per place. [2021-11-20 05:49:22,826 INFO L132 encePairwiseOnDemand]: 108/121 looper letters, 22 selfloop transitions, 17 changer transitions 45/164 dead transitions. [2021-11-20 05:49:22,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 761 flow [2021-11-20 05:49:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 05:49:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-20 05:49:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1379 transitions. [2021-11-20 05:49:22,832 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8140495867768595 [2021-11-20 05:49:22,832 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1379 transitions. [2021-11-20 05:49:22,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1379 transitions. [2021-11-20 05:49:22,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:22,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1379 transitions. [2021-11-20 05:49:22,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 98.5) internal successors, (1379), 14 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:22,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:22,843 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:22,843 INFO L186 Difference]: Start difference. First operand has 129 places, 117 transitions, 342 flow. Second operand 14 states and 1379 transitions. [2021-11-20 05:49:22,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 761 flow [2021-11-20 05:49:22,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 164 transitions, 761 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-20 05:49:22,852 INFO L242 Difference]: Finished difference. Result has 150 places, 115 transitions, 400 flow [2021-11-20 05:49:22,852 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=400, PETRI_PLACES=150, PETRI_TRANSITIONS=115} [2021-11-20 05:49:22,853 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 24 predicate places. [2021-11-20 05:49:22,854 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 115 transitions, 400 flow [2021-11-20 05:49:22,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 95.5) internal successors, (1146), 12 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:22,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:22,855 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:22,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 05:49:22,856 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1232447061, now seen corresponding path program 1 times [2021-11-20 05:49:22,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:22,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463391841] [2021-11-20 05:49:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:22,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:22,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463391841] [2021-11-20 05:49:22,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463391841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:22,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:22,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:49:22,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32541647] [2021-11-20 05:49:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:22,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:49:22,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:22,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:49:22,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:49:22,998 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2021-11-20 05:49:22,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 115 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:22,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:22,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2021-11-20 05:49:23,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:23,531 INFO L129 PetriNetUnfolder]: 435/1161 cut-off events. [2021-11-20 05:49:23,532 INFO L130 PetriNetUnfolder]: For 4628/4790 co-relation queries the response was YES. [2021-11-20 05:49:23,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 1161 events. 435/1161 cut-off events. For 4628/4790 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7347 event pairs, 97 based on Foata normal form. 17/1140 useless extension candidates. Maximal degree in co-relation 3839. Up to 344 conditions per place. [2021-11-20 05:49:23,550 INFO L132 encePairwiseOnDemand]: 115/121 looper letters, 56 selfloop transitions, 5 changer transitions 3/151 dead transitions. [2021-11-20 05:49:23,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 151 transitions, 819 flow [2021-11-20 05:49:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:49:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 05:49:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2021-11-20 05:49:23,554 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-11-20 05:49:23,554 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2021-11-20 05:49:23,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2021-11-20 05:49:23,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:23,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2021-11-20 05:49:23,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:23,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:23,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:23,561 INFO L186 Difference]: Start difference. First operand has 150 places, 115 transitions, 400 flow. Second operand 7 states and 726 transitions. [2021-11-20 05:49:23,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 151 transitions, 819 flow [2021-11-20 05:49:23,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 671 flow, removed 67 selfloop flow, removed 14 redundant places. [2021-11-20 05:49:23,577 INFO L242 Difference]: Finished difference. Result has 135 places, 119 transitions, 395 flow [2021-11-20 05:49:23,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=135, PETRI_TRANSITIONS=119} [2021-11-20 05:49:23,578 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2021-11-20 05:49:23,579 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 395 flow [2021-11-20 05:49:23,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:23,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:23,580 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:23,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 05:49:23,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1764064367, now seen corresponding path program 2 times [2021-11-20 05:49:23,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:23,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802298817] [2021-11-20 05:49:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:23,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:23,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:23,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802298817] [2021-11-20 05:49:23,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802298817] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:23,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:23,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:49:23,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159942571] [2021-11-20 05:49:23,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:23,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:49:23,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:23,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:49:23,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:49:23,735 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2021-11-20 05:49:23,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:23,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:23,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2021-11-20 05:49:23,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:24,621 INFO L129 PetriNetUnfolder]: 1518/3356 cut-off events. [2021-11-20 05:49:24,622 INFO L130 PetriNetUnfolder]: For 4255/4307 co-relation queries the response was YES. [2021-11-20 05:49:24,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8373 conditions, 3356 events. 1518/3356 cut-off events. For 4255/4307 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26009 event pairs, 96 based on Foata normal form. 24/3269 useless extension candidates. Maximal degree in co-relation 8301. Up to 981 conditions per place. [2021-11-20 05:49:24,659 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 50 selfloop transitions, 13 changer transitions 30/180 dead transitions. [2021-11-20 05:49:24,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 180 transitions, 823 flow [2021-11-20 05:49:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 05:49:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 05:49:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1052 transitions. [2021-11-20 05:49:24,665 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8694214876033057 [2021-11-20 05:49:24,665 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1052 transitions. [2021-11-20 05:49:24,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1052 transitions. [2021-11-20 05:49:24,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:24,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1052 transitions. [2021-11-20 05:49:24,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.2) internal successors, (1052), 10 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:24,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:24,674 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:24,675 INFO L186 Difference]: Start difference. First operand has 135 places, 119 transitions, 395 flow. Second operand 10 states and 1052 transitions. [2021-11-20 05:49:24,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 180 transitions, 823 flow [2021-11-20 05:49:24,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 180 transitions, 756 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-11-20 05:49:24,691 INFO L242 Difference]: Finished difference. Result has 144 places, 123 transitions, 418 flow [2021-11-20 05:49:24,692 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=418, PETRI_PLACES=144, PETRI_TRANSITIONS=123} [2021-11-20 05:49:24,693 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 18 predicate places. [2021-11-20 05:49:24,693 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 123 transitions, 418 flow [2021-11-20 05:49:24,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:24,694 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:24,694 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:24,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 05:49:24,695 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -836874500, now seen corresponding path program 1 times [2021-11-20 05:49:24,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586225453] [2021-11-20 05:49:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:24,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:24,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:24,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586225453] [2021-11-20 05:49:24,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586225453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:24,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:24,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:49:24,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386393210] [2021-11-20 05:49:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:24,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:49:24,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:49:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:49:24,874 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2021-11-20 05:49:24,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 123 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:24,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:24,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2021-11-20 05:49:24,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:25,905 INFO L129 PetriNetUnfolder]: 1244/2990 cut-off events. [2021-11-20 05:49:25,905 INFO L130 PetriNetUnfolder]: For 5484/5515 co-relation queries the response was YES. [2021-11-20 05:49:25,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9142 conditions, 2990 events. 1244/2990 cut-off events. For 5484/5515 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24735 event pairs, 66 based on Foata normal form. 65/3005 useless extension candidates. Maximal degree in co-relation 9066. Up to 553 conditions per place. [2021-11-20 05:49:25,944 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 57 selfloop transitions, 24 changer transitions 43/209 dead transitions. [2021-11-20 05:49:25,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 209 transitions, 1140 flow [2021-11-20 05:49:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 05:49:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-20 05:49:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1366 transitions. [2021-11-20 05:49:25,951 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8684043229497775 [2021-11-20 05:49:25,951 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1366 transitions. [2021-11-20 05:49:25,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1366 transitions. [2021-11-20 05:49:25,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:25,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1366 transitions. [2021-11-20 05:49:25,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.07692307692308) internal successors, (1366), 13 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:25,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:25,965 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:25,965 INFO L186 Difference]: Start difference. First operand has 144 places, 123 transitions, 418 flow. Second operand 13 states and 1366 transitions. [2021-11-20 05:49:25,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 209 transitions, 1140 flow [2021-11-20 05:49:25,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 209 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-20 05:49:26,046 INFO L242 Difference]: Finished difference. Result has 161 places, 135 transitions, 594 flow [2021-11-20 05:49:26,047 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=594, PETRI_PLACES=161, PETRI_TRANSITIONS=135} [2021-11-20 05:49:26,048 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 35 predicate places. [2021-11-20 05:49:26,048 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 135 transitions, 594 flow [2021-11-20 05:49:26,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:26,049 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:26,049 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:26,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 05:49:26,049 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash -568464528, now seen corresponding path program 1 times [2021-11-20 05:49:26,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:26,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391858229] [2021-11-20 05:49:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:26,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:26,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:26,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391858229] [2021-11-20 05:49:26,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391858229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:26,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:26,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 05:49:26,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532625436] [2021-11-20 05:49:26,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:26,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 05:49:26,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 05:49:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:49:26,223 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 121 [2021-11-20 05:49:26,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 135 transitions, 594 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:26,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:26,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 121 [2021-11-20 05:49:26,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:27,339 INFO L129 PetriNetUnfolder]: 1054/2723 cut-off events. [2021-11-20 05:49:27,339 INFO L130 PetriNetUnfolder]: For 7272/7305 co-relation queries the response was YES. [2021-11-20 05:49:27,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 2723 events. 1054/2723 cut-off events. For 7272/7305 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 23828 event pairs, 63 based on Foata normal form. 29/2702 useless extension candidates. Maximal degree in co-relation 9296. Up to 426 conditions per place. [2021-11-20 05:49:27,380 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 38 selfloop transitions, 22 changer transitions 57/202 dead transitions. [2021-11-20 05:49:27,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 202 transitions, 1208 flow [2021-11-20 05:49:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 05:49:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-20 05:49:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1646 transitions. [2021-11-20 05:49:27,388 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8502066115702479 [2021-11-20 05:49:27,389 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1646 transitions. [2021-11-20 05:49:27,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1646 transitions. [2021-11-20 05:49:27,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:27,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1646 transitions. [2021-11-20 05:49:27,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 102.875) internal successors, (1646), 16 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:27,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:27,405 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:27,405 INFO L186 Difference]: Start difference. First operand has 161 places, 135 transitions, 594 flow. Second operand 16 states and 1646 transitions. [2021-11-20 05:49:27,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 202 transitions, 1208 flow [2021-11-20 05:49:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 202 transitions, 1064 flow, removed 64 selfloop flow, removed 12 redundant places. [2021-11-20 05:49:27,513 INFO L242 Difference]: Finished difference. Result has 168 places, 128 transitions, 534 flow [2021-11-20 05:49:27,514 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=534, PETRI_PLACES=168, PETRI_TRANSITIONS=128} [2021-11-20 05:49:27,514 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 42 predicate places. [2021-11-20 05:49:27,515 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 128 transitions, 534 flow [2021-11-20 05:49:27,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:27,516 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:27,516 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:27,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 05:49:27,516 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash 373276383, now seen corresponding path program 1 times [2021-11-20 05:49:27,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:27,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938864750] [2021-11-20 05:49:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:27,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:49:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:49:27,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:49:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938864750] [2021-11-20 05:49:27,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938864750] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:49:27,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:49:27,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:49:27,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652895302] [2021-11-20 05:49:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:49:27,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:49:27,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:49:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:49:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:49:27,679 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 121 [2021-11-20 05:49:27,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 128 transitions, 534 flow. Second operand has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:27,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:49:27,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 121 [2021-11-20 05:49:27,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:49:28,156 INFO L129 PetriNetUnfolder]: 286/1740 cut-off events. [2021-11-20 05:49:28,156 INFO L130 PetriNetUnfolder]: For 3970/4113 co-relation queries the response was YES. [2021-11-20 05:49:28,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5113 conditions, 1740 events. 286/1740 cut-off events. For 3970/4113 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 17730 event pairs, 32 based on Foata normal form. 1/1630 useless extension candidates. Maximal degree in co-relation 5028. Up to 234 conditions per place. [2021-11-20 05:49:28,182 INFO L132 encePairwiseOnDemand]: 115/121 looper letters, 23 selfloop transitions, 1 changer transitions 19/148 dead transitions. [2021-11-20 05:49:28,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 148 transitions, 692 flow [2021-11-20 05:49:28,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 05:49:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 05:49:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 720 transitions. [2021-11-20 05:49:28,186 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8500590318772137 [2021-11-20 05:49:28,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 720 transitions. [2021-11-20 05:49:28,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 720 transitions. [2021-11-20 05:49:28,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:49:28,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 720 transitions. [2021-11-20 05:49:28,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:28,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:28,194 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:28,195 INFO L186 Difference]: Start difference. First operand has 168 places, 128 transitions, 534 flow. Second operand 7 states and 720 transitions. [2021-11-20 05:49:28,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 148 transitions, 692 flow [2021-11-20 05:49:28,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 148 transitions, 608 flow, removed 19 selfloop flow, removed 16 redundant places. [2021-11-20 05:49:28,258 INFO L242 Difference]: Finished difference. Result has 154 places, 125 transitions, 448 flow [2021-11-20 05:49:28,258 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=154, PETRI_TRANSITIONS=125} [2021-11-20 05:49:28,259 INFO L334 CegarLoopForPetriNet]: 126 programPoint places, 28 predicate places. [2021-11-20 05:49:28,260 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 125 transitions, 448 flow [2021-11-20 05:49:28,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:49:28,261 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:49:28,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:49:28,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 05:49:28,261 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 05:49:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:49:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1638176163, now seen corresponding path program 2 times [2021-11-20 05:49:28,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:49:28,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919454691] [2021-11-20 05:49:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:49:28,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:49:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:49:28,327 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 05:49:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 05:49:28,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 05:49:28,440 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 05:49:28,442 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-20 05:49:28,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-20 05:49:28,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-11-20 05:49:28,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-11-20 05:49:28,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-11-20 05:49:28,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-20 05:49:28,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 05:49:28,451 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2021-11-20 05:49:28,457 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-20 05:49:28,457 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 05:49:28,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:49:28 BasicIcfg [2021-11-20 05:49:28,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 05:49:28,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 05:49:28,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 05:49:28,674 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 05:49:28,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:17" (3/4) ... [2021-11-20 05:49:28,676 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 05:49:28,829 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 05:49:28,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 05:49:28,834 INFO L158 Benchmark]: Toolchain (without parser) took 14021.38ms. Allocated memory was 92.3MB in the beginning and 306.2MB in the end (delta: 213.9MB). Free memory was 56.0MB in the beginning and 199.0MB in the end (delta: -143.0MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,835 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:49:28,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 799.90ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 55.8MB in the beginning and 84.7MB in the end (delta: -28.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.19ms. Allocated memory is still 123.7MB. Free memory was 84.7MB in the beginning and 81.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,837 INFO L158 Benchmark]: Boogie Preprocessor took 75.27ms. Allocated memory is still 123.7MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,837 INFO L158 Benchmark]: RCFGBuilder took 1590.04ms. Allocated memory is still 123.7MB. Free memory was 79.8MB in the beginning and 61.2MB in the end (delta: 18.6MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,838 INFO L158 Benchmark]: TraceAbstraction took 11298.67ms. Allocated memory was 123.7MB in the beginning and 306.2MB in the end (delta: 182.5MB). Free memory was 60.4MB in the beginning and 232.6MB in the end (delta: -172.1MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,838 INFO L158 Benchmark]: Witness Printer took 160.08ms. Allocated memory is still 306.2MB. Free memory was 232.6MB in the beginning and 199.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-11-20 05:49:28,842 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 799.90ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 55.8MB in the beginning and 84.7MB in the end (delta: -28.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.19ms. Allocated memory is still 123.7MB. Free memory was 84.7MB in the beginning and 81.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.27ms. Allocated memory is still 123.7MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1590.04ms. Allocated memory is still 123.7MB. Free memory was 79.8MB in the beginning and 61.2MB in the end (delta: 18.6MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11298.67ms. Allocated memory was 123.7MB in the beginning and 306.2MB in the end (delta: 182.5MB). Free memory was 60.4MB in the beginning and 232.6MB in the end (delta: -172.1MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. * Witness Printer took 160.08ms. Allocated memory is still 306.2MB. Free memory was 232.6MB in the beginning and 199.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L725] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L726] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L727] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L728] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L729] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L734] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L735] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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}] [L736] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L737] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L738] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L739] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L835] 0 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t299={5: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] [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-2, t299={5: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] [L837] 0 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6: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] [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=-1, t299={5:0}, t300={6: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] [L839] 0 pthread_t t301; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3: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] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=0, t299={5:0}, t300={6:0}, t301={3: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] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0: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=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0: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=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0: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=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1] [L755] 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) [L755] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L755] 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) [L755] 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) [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 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 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 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 [L790] 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) [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L813] 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) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] 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) [L813] 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) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 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 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 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 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0: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=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3: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=1, z=1] [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, 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=1, z=1] [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L846] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L846] 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) [L846] 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) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 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 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L850] 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 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 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) [L857] 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) [L858] 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)) [L858] 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)) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=49, weak$$choice2=255, 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=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 532 mSDsluCounter, 356 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1152 IncrementalHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 77 mSDtfsCounter, 1152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=594occurred in iteration=8, InterpolantAutomatonStates: 101, 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.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 917 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 812 ConstructedInterpolants, 0 QuantifiedInterpolants, 3440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2021-11-20 05:49:28,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1d397a-8c19-4cc3-956e-b1c81151605d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE