./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.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_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/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_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/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_21c3057c-68be-48a4-862f-05df94d9f73c/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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:15:16,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:15:16,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:15:16,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:15:16,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:15:16,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:15:16,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:15:16,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:15:16,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:15:16,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:15:16,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:15:16,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:15:16,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:15:16,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:15:16,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:15:16,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:15:16,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:15:16,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:15:16,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:15:16,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:15:16,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:15:16,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:15:16,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:15:16,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:15:16,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:15:16,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:15:16,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:15:16,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:15:16,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:15:16,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:15:16,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:15:16,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:15:16,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:15:16,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:15:16,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:15:16,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:15:16,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:15:16,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:15:16,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:15:16,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:15:16,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:15:16,316 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:15:16,366 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:15:16,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:15:16,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:15:16,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:15:16,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:15:16,375 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:15:16,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:15:16,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:15:16,376 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:15:16,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:15:16,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:15:16,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:15:16,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:15:16,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:15:16,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:15:16,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:15:16,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:15:16,380 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:15:16,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:15:16,380 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:15:16,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:15:16,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:15:16,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:15:16,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:15:16,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:15:16,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:15:16,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:15:16,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:15:16,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:15:16,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:15:16,383 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:15:16,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:15:16,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:15:16,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:15:16,384 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_21c3057c-68be-48a4-862f-05df94d9f73c/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_21c3057c-68be-48a4-862f-05df94d9f73c/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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2021-11-20 07:15:16,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:15:16,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:15:16,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:15:16,716 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:15:16,717 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:15:16,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-11-20 07:15:16,804 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/data/92154d0dc/d364b445fe324bf1b6a491851437721e/FLAG7c81ea7ec [2021-11-20 07:15:17,373 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:15:17,374 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-11-20 07:15:17,393 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/data/92154d0dc/d364b445fe324bf1b6a491851437721e/FLAG7c81ea7ec [2021-11-20 07:15:17,627 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/data/92154d0dc/d364b445fe324bf1b6a491851437721e [2021-11-20 07:15:17,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:15:17,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:15:17,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:15:17,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:15:17,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:15:17,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:15:17" (1/1) ... [2021-11-20 07:15:17,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d1a6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:17, skipping insertion in model container [2021-11-20 07:15:17,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:15:17" (1/1) ... [2021-11-20 07:15:17,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:15:17,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:15:17,917 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_21c3057c-68be-48a4-862f-05df94d9f73c/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2021-11-20 07:15:18,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:15:18,150 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:15:18,163 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_21c3057c-68be-48a4-862f-05df94d9f73c/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2021-11-20 07:15:18,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:15:18,285 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:15:18,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18 WrapperNode [2021-11-20 07:15:18,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:15:18,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:15:18,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:15:18,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:15:18,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,373 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-11-20 07:15:18,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:15:18,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:15:18,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:15:18,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:15:18,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:15:18,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:15:18,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:15:18,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:15:18,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (1/1) ... [2021-11-20 07:15:18,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:15:18,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:15:18,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:15:18,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:15:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 07:15:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-20 07:15:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:15:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:15:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:15:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-20 07:15:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-20 07:15:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-20 07:15:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-20 07:15:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-20 07:15:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-20 07:15:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:15:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-20 07:15:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:15:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:15:18,531 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 07:15:18,660 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:15:18,662 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:15:19,290 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:15:19,609 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:15:19,610 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:15:19,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:15:19 BoogieIcfgContainer [2021-11-20 07:15:19,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:15:19,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:15:19,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:15:19,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:15:19,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:15:17" (1/3) ... [2021-11-20 07:15:19,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33087aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:15:19, skipping insertion in model container [2021-11-20 07:15:19,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:15:18" (2/3) ... [2021-11-20 07:15:19,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33087aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:15:19, skipping insertion in model container [2021-11-20 07:15:19,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:15:19" (3/3) ... [2021-11-20 07:15:19,625 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2021-11-20 07:15:19,631 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 07:15:19,632 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:15:19,632 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-20 07:15:19,632 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 07:15:19,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,684 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,684 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,700 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,701 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,705 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,705 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,705 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,706 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,706 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,706 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,706 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,706 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,707 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,707 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,708 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,708 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,708 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,708 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,708 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,709 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,709 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,709 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,710 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,715 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,716 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,717 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,717 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,717 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,718 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,727 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,727 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,733 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,733 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,734 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,734 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,737 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,738 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,738 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 07:15:19,742 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-20 07:15:19,800 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:15:19,808 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 07:15:19,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-20 07:15:19,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-11-20 07:15:19,874 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-11-20 07:15:19,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 07:15:19,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-11-20 07:15:19,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-11-20 07:15:19,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-11-20 07:15:19,900 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-11-20 07:15:19,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 07:15:19,900 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:19,901 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] [2021-11-20 07:15:19,902 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 07:15:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash -388777824, now seen corresponding path program 1 times [2021-11-20 07:15:19,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:19,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632368335] [2021-11-20 07:15:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:19,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:20,312 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 07:15:20,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632368335] [2021-11-20 07:15:20,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632368335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:20,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:20,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:15:20,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455528252] [2021-11-20 07:15:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:20,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:15:20,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:15:20,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:15:20,379 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-11-20 07:15:20,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 07:15:20,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:20,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-11-20 07:15:20,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:20,594 INFO L129 PetriNetUnfolder]: 57/323 cut-off events. [2021-11-20 07:15:20,594 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-11-20 07:15:20,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1318 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2021-11-20 07:15:20,604 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2021-11-20 07:15:20,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2021-11-20 07:15:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:15:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-20 07:15:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2021-11-20 07:15:20,629 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2021-11-20 07:15:20,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2021-11-20 07:15:20,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2021-11-20 07:15:20,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:20,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2021-11-20 07:15:20,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 07:15:20,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 07:15:20,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 07:15:20,661 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2021-11-20 07:15:20,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2021-11-20 07:15:20,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-20 07:15:20,673 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-11-20 07:15:20,676 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-11-20 07:15:20,683 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-11-20 07:15:20,683 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-11-20 07:15:20,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 07:15:20,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:20,684 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] [2021-11-20 07:15:20,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:15:20,685 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 07:15:20,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1563106335, now seen corresponding path program 1 times [2021-11-20 07:15:20,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:20,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863022215] [2021-11-20 07:15:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:20,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:21,059 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 07:15:21,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:21,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863022215] [2021-11-20 07:15:21,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863022215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:21,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:21,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:15:21,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949456632] [2021-11-20 07:15:21,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:21,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:15:21,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:15:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:15:21,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-20 07:15:21,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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 07:15:21,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:21,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-20 07:15:21,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:22,054 INFO L129 PetriNetUnfolder]: 1096/2752 cut-off events. [2021-11-20 07:15:22,054 INFO L130 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2021-11-20 07:15:22,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4576 conditions, 2752 events. 1096/2752 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 20931 event pairs, 260 based on Foata normal form. 0/2666 useless extension candidates. Maximal degree in co-relation 4525. Up to 870 conditions per place. [2021-11-20 07:15:22,083 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 24 selfloop transitions, 3 changer transitions 63/166 dead transitions. [2021-11-20 07:15:22,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 166 transitions, 516 flow [2021-11-20 07:15:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:15:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 07:15:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 891 transitions. [2021-11-20 07:15:22,091 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.868421052631579 [2021-11-20 07:15:22,092 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 891 transitions. [2021-11-20 07:15:22,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 891 transitions. [2021-11-20 07:15:22,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:22,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 891 transitions. [2021-11-20 07:15:22,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.0) internal successors, (891), 9 states have internal predecessors, (891), 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 07:15:22,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:22,104 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:22,104 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 891 transitions. [2021-11-20 07:15:22,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 166 transitions, 516 flow [2021-11-20 07:15:22,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 166 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-20 07:15:22,114 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 239 flow [2021-11-20 07:15:22,115 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2021-11-20 07:15:22,116 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-11-20 07:15:22,116 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 239 flow [2021-11-20 07:15:22,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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 07:15:22,117 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:22,118 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] [2021-11-20 07:15:22,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:15:22,118 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 07:15:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash 385992406, now seen corresponding path program 1 times [2021-11-20 07:15:22,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:22,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981704364] [2021-11-20 07:15:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:22,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:22,474 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 07:15:22,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:22,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981704364] [2021-11-20 07:15:22,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981704364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:22,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:22,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:15:22,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88497459] [2021-11-20 07:15:22,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:22,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:15:22,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:15:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:15:22,483 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2021-11-20 07:15:22,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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 07:15:22,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:22,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2021-11-20 07:15:22,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:23,053 INFO L129 PetriNetUnfolder]: 448/1044 cut-off events. [2021-11-20 07:15:23,053 INFO L130 PetriNetUnfolder]: For 774/779 co-relation queries the response was YES. [2021-11-20 07:15:23,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 1044 events. 448/1044 cut-off events. For 774/779 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6003 event pairs, 223 based on Foata normal form. 30/1028 useless extension candidates. Maximal degree in co-relation 2282. Up to 334 conditions per place. [2021-11-20 07:15:23,065 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 20 selfloop transitions, 2 changer transitions 31/134 dead transitions. [2021-11-20 07:15:23,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 134 transitions, 441 flow [2021-11-20 07:15:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:15:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 07:15:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2021-11-20 07:15:23,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8693957115009746 [2021-11-20 07:15:23,070 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2021-11-20 07:15:23,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2021-11-20 07:15:23,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:23,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2021-11-20 07:15:23,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 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 07:15:23,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:23,078 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:23,079 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 239 flow. Second operand 9 states and 892 transitions. [2021-11-20 07:15:23,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 134 transitions, 441 flow [2021-11-20 07:15:23,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 134 transitions, 424 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-11-20 07:15:23,090 INFO L242 Difference]: Finished difference. Result has 122 places, 97 transitions, 250 flow [2021-11-20 07:15:23,090 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2021-11-20 07:15:23,091 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2021-11-20 07:15:23,091 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 250 flow [2021-11-20 07:15:23,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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 07:15:23,092 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:23,092 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] [2021-11-20 07:15:23,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:15:23,093 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 07:15:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1963237175, now seen corresponding path program 1 times [2021-11-20 07:15:23,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:23,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932436033] [2021-11-20 07:15:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:23,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:23,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 07:15:23,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:23,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932436033] [2021-11-20 07:15:23,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932436033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:23,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:23,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:15:23,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681910514] [2021-11-20 07:15:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:23,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:15:23,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:15:23,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:15:23,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2021-11-20 07:15:23,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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 07:15:23,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:23,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2021-11-20 07:15:23,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:23,730 INFO L129 PetriNetUnfolder]: 311/753 cut-off events. [2021-11-20 07:15:23,731 INFO L130 PetriNetUnfolder]: For 777/777 co-relation queries the response was YES. [2021-11-20 07:15:23,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 753 events. 311/753 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3896 event pairs, 89 based on Foata normal form. 16/733 useless extension candidates. Maximal degree in co-relation 1734. Up to 293 conditions per place. [2021-11-20 07:15:23,741 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 25/126 dead transitions. [2021-11-20 07:15:23,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 426 flow [2021-11-20 07:15:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:15:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 07:15:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 884 transitions. [2021-11-20 07:15:23,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8615984405458089 [2021-11-20 07:15:23,746 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 884 transitions. [2021-11-20 07:15:23,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 884 transitions. [2021-11-20 07:15:23,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:23,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 884 transitions. [2021-11-20 07:15:23,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.22222222222223) internal successors, (884), 9 states have internal predecessors, (884), 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 07:15:23,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:23,757 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:23,757 INFO L186 Difference]: Start difference. First operand has 122 places, 97 transitions, 250 flow. Second operand 9 states and 884 transitions. [2021-11-20 07:15:23,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 426 flow [2021-11-20 07:15:23,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 126 transitions, 394 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-11-20 07:15:23,768 INFO L242 Difference]: Finished difference. Result has 123 places, 97 transitions, 254 flow [2021-11-20 07:15:23,769 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=254, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2021-11-20 07:15:23,771 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 4 predicate places. [2021-11-20 07:15:23,772 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 254 flow [2021-11-20 07:15:23,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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 07:15:23,772 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:23,773 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] [2021-11-20 07:15:23,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:15:23,773 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 07:15:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1053293381, now seen corresponding path program 1 times [2021-11-20 07:15:23,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:23,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037175583] [2021-11-20 07:15:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:23,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:23,986 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 07:15:23,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037175583] [2021-11-20 07:15:23,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037175583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:23,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:23,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:15:23,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813557330] [2021-11-20 07:15:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:23,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:15:23,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:15:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:15:23,991 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-11-20 07:15:23,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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 07:15:23,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:23,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-11-20 07:15:23,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:24,542 INFO L129 PetriNetUnfolder]: 572/1284 cut-off events. [2021-11-20 07:15:24,543 INFO L130 PetriNetUnfolder]: For 1519/1519 co-relation queries the response was YES. [2021-11-20 07:15:24,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 1284 events. 572/1284 cut-off events. For 1519/1519 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7642 event pairs, 172 based on Foata normal form. 20/1231 useless extension candidates. Maximal degree in co-relation 3190. Up to 427 conditions per place. [2021-11-20 07:15:24,556 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 29 selfloop transitions, 5 changer transitions 25/134 dead transitions. [2021-11-20 07:15:24,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 134 transitions, 539 flow [2021-11-20 07:15:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:15:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 07:15:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2021-11-20 07:15:24,560 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8558897243107769 [2021-11-20 07:15:24,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2021-11-20 07:15:24,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2021-11-20 07:15:24,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:24,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2021-11-20 07:15:24,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 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 07:15:24,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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 07:15:24,567 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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 07:15:24,567 INFO L186 Difference]: Start difference. First operand has 123 places, 97 transitions, 254 flow. Second operand 7 states and 683 transitions. [2021-11-20 07:15:24,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 134 transitions, 539 flow [2021-11-20 07:15:24,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 134 transitions, 511 flow, removed 10 selfloop flow, removed 8 redundant places. [2021-11-20 07:15:24,580 INFO L242 Difference]: Finished difference. Result has 119 places, 97 transitions, 261 flow [2021-11-20 07:15:24,580 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=119, PETRI_TRANSITIONS=97} [2021-11-20 07:15:24,581 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places. [2021-11-20 07:15:24,581 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 97 transitions, 261 flow [2021-11-20 07:15:24,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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 07:15:24,582 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:24,582 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] [2021-11-20 07:15:24,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:15:24,583 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 07:15:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2099316389, now seen corresponding path program 2 times [2021-11-20 07:15:24,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:24,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491845510] [2021-11-20 07:15:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:24,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:24,705 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 07:15:24,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:24,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491845510] [2021-11-20 07:15:24,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491845510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:24,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:24,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:15:24,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211561525] [2021-11-20 07:15:24,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:24,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:15:24,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:15:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:15:24,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-11-20 07:15:24,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 97 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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 07:15:24,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:24,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-11-20 07:15:24,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:25,136 INFO L129 PetriNetUnfolder]: 422/987 cut-off events. [2021-11-20 07:15:25,137 INFO L130 PetriNetUnfolder]: For 1142/1142 co-relation queries the response was YES. [2021-11-20 07:15:25,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 987 events. 422/987 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5652 event pairs, 129 based on Foata normal form. 20/953 useless extension candidates. Maximal degree in co-relation 2429. Up to 257 conditions per place. [2021-11-20 07:15:25,146 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 22 selfloop transitions, 4 changer transitions 28/129 dead transitions. [2021-11-20 07:15:25,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 129 transitions, 512 flow [2021-11-20 07:15:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:15:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-20 07:15:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2021-11-20 07:15:25,150 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.849624060150376 [2021-11-20 07:15:25,150 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2021-11-20 07:15:25,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2021-11-20 07:15:25,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:25,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2021-11-20 07:15:25,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 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 07:15:25,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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 07:15:25,156 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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 07:15:25,156 INFO L186 Difference]: Start difference. First operand has 119 places, 97 transitions, 261 flow. Second operand 7 states and 678 transitions. [2021-11-20 07:15:25,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 129 transitions, 512 flow [2021-11-20 07:15:25,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 129 transitions, 478 flow, removed 11 selfloop flow, removed 6 redundant places. [2021-11-20 07:15:25,168 INFO L242 Difference]: Finished difference. Result has 120 places, 95 transitions, 248 flow [2021-11-20 07:15:25,169 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2021-11-20 07:15:25,171 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2021-11-20 07:15:25,172 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 248 flow [2021-11-20 07:15:25,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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 07:15:25,172 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:25,172 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] [2021-11-20 07:15:25,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:15:25,173 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 07:15:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -77173614, now seen corresponding path program 1 times [2021-11-20 07:15:25,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:25,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451253649] [2021-11-20 07:15:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:25,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:25,308 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 07:15:25,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:25,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451253649] [2021-11-20 07:15:25,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451253649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:25,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:25,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:15:25,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241543251] [2021-11-20 07:15:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:25,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:15:25,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:15:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:15:25,312 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-20 07:15:25,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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 07:15:25,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:25,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-20 07:15:25,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:25,631 INFO L129 PetriNetUnfolder]: 212/528 cut-off events. [2021-11-20 07:15:25,631 INFO L130 PetriNetUnfolder]: For 395/395 co-relation queries the response was YES. [2021-11-20 07:15:25,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 528 events. 212/528 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2385 event pairs, 54 based on Foata normal form. 12/517 useless extension candidates. Maximal degree in co-relation 1183. Up to 176 conditions per place. [2021-11-20 07:15:25,637 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 22 selfloop transitions, 2 changer transitions 25/125 dead transitions. [2021-11-20 07:15:25,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 458 flow [2021-11-20 07:15:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:15:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 07:15:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 861 transitions. [2021-11-20 07:15:25,641 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8391812865497076 [2021-11-20 07:15:25,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 861 transitions. [2021-11-20 07:15:25,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 861 transitions. [2021-11-20 07:15:25,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:25,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 861 transitions. [2021-11-20 07:15:25,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 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 07:15:25,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:25,649 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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 07:15:25,650 INFO L186 Difference]: Start difference. First operand has 120 places, 95 transitions, 248 flow. Second operand 9 states and 861 transitions. [2021-11-20 07:15:25,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 458 flow [2021-11-20 07:15:25,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 125 transitions, 422 flow, removed 13 selfloop flow, removed 7 redundant places. [2021-11-20 07:15:25,655 INFO L242 Difference]: Finished difference. Result has 125 places, 95 transitions, 248 flow [2021-11-20 07:15:25,656 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=248, PETRI_PLACES=125, PETRI_TRANSITIONS=95} [2021-11-20 07:15:25,656 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 6 predicate places. [2021-11-20 07:15:25,657 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 95 transitions, 248 flow [2021-11-20 07:15:25,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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 07:15:25,657 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:25,658 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 07:15:25,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:15:25,658 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 07:15:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1687907716, now seen corresponding path program 1 times [2021-11-20 07:15:25,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:25,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739003227] [2021-11-20 07:15:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:25,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:25,778 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 07:15:25,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:25,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739003227] [2021-11-20 07:15:25,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739003227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:25,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:25,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:15:25,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430268783] [2021-11-20 07:15:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:25,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:15:25,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:15:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:15:25,781 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-11-20 07:15:25,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 95 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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 07:15:25,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:25,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-11-20 07:15:25,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:26,123 INFO L129 PetriNetUnfolder]: 204/560 cut-off events. [2021-11-20 07:15:26,124 INFO L130 PetriNetUnfolder]: For 447/447 co-relation queries the response was YES. [2021-11-20 07:15:26,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 560 events. 204/560 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2827 event pairs, 64 based on Foata normal form. 8/545 useless extension candidates. Maximal degree in co-relation 1174. Up to 169 conditions per place. [2021-11-20 07:15:26,130 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 21 selfloop transitions, 2 changer transitions 24/122 dead transitions. [2021-11-20 07:15:26,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 433 flow [2021-11-20 07:15:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:15:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-20 07:15:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 760 transitions. [2021-11-20 07:15:26,133 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-11-20 07:15:26,134 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 760 transitions. [2021-11-20 07:15:26,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 760 transitions. [2021-11-20 07:15:26,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:26,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 760 transitions. [2021-11-20 07:15:26,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 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 07:15:26,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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 07:15:26,141 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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 07:15:26,141 INFO L186 Difference]: Start difference. First operand has 125 places, 95 transitions, 248 flow. Second operand 8 states and 760 transitions. [2021-11-20 07:15:26,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 433 flow [2021-11-20 07:15:26,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 122 transitions, 385 flow, removed 21 selfloop flow, removed 11 redundant places. [2021-11-20 07:15:26,147 INFO L242 Difference]: Finished difference. Result has 120 places, 95 transitions, 236 flow [2021-11-20 07:15:26,147 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=236, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2021-11-20 07:15:26,148 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2021-11-20 07:15:26,148 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 236 flow [2021-11-20 07:15:26,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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 07:15:26,149 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:26,149 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 07:15:26,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:15:26,149 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 07:15:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash 362256278, now seen corresponding path program 2 times [2021-11-20 07:15:26,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:26,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604037035] [2021-11-20 07:15:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:26,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:26,438 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 07:15:26,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:26,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604037035] [2021-11-20 07:15:26,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604037035] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:26,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:26,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:15:26,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113115671] [2021-11-20 07:15:26,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:26,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 07:15:26,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 07:15:26,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:15:26,443 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-11-20 07:15:26,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 236 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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 07:15:26,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:26,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-11-20 07:15:26,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:26,949 INFO L129 PetriNetUnfolder]: 186/494 cut-off events. [2021-11-20 07:15:26,949 INFO L130 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2021-11-20 07:15:26,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 494 events. 186/494 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2067 event pairs, 56 based on Foata normal form. 12/498 useless extension candidates. Maximal degree in co-relation 919. Up to 195 conditions per place. [2021-11-20 07:15:26,954 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 18 selfloop transitions, 9 changer transitions 28/130 dead transitions. [2021-11-20 07:15:26,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 130 transitions, 438 flow [2021-11-20 07:15:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:15:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-20 07:15:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1303 transitions. [2021-11-20 07:15:26,961 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8164160401002506 [2021-11-20 07:15:26,961 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1303 transitions. [2021-11-20 07:15:26,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1303 transitions. [2021-11-20 07:15:26,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:26,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1303 transitions. [2021-11-20 07:15:26,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.07142857142857) internal successors, (1303), 14 states have internal predecessors, (1303), 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 07:15:26,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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 07:15:26,974 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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 07:15:26,974 INFO L186 Difference]: Start difference. First operand has 120 places, 95 transitions, 236 flow. Second operand 14 states and 1303 transitions. [2021-11-20 07:15:26,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 130 transitions, 438 flow [2021-11-20 07:15:26,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 130 transitions, 398 flow, removed 15 selfloop flow, removed 9 redundant places. [2021-11-20 07:15:26,980 INFO L242 Difference]: Finished difference. Result has 126 places, 98 transitions, 278 flow [2021-11-20 07:15:26,981 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=278, PETRI_PLACES=126, PETRI_TRANSITIONS=98} [2021-11-20 07:15:26,982 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2021-11-20 07:15:26,982 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 98 transitions, 278 flow [2021-11-20 07:15:26,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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 07:15:26,983 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:26,984 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] [2021-11-20 07:15:26,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:15:26,985 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 07:15:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:26,986 INFO L85 PathProgramCache]: Analyzing trace with hash -19491460, now seen corresponding path program 1 times [2021-11-20 07:15:26,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:26,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956759833] [2021-11-20 07:15:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:26,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:27,113 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 07:15:27,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956759833] [2021-11-20 07:15:27,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956759833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:27,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:27,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:15:27,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399771097] [2021-11-20 07:15:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:27,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:15:27,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:15:27,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:15:27,122 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-20 07:15:27,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 98 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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 07:15:27,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:27,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-20 07:15:27,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:27,598 INFO L129 PetriNetUnfolder]: 696/1551 cut-off events. [2021-11-20 07:15:27,598 INFO L130 PetriNetUnfolder]: For 2788/2838 co-relation queries the response was YES. [2021-11-20 07:15:27,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4101 conditions, 1551 events. 696/1551 cut-off events. For 2788/2838 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9304 event pairs, 41 based on Foata normal form. 1/1499 useless extension candidates. Maximal degree in co-relation 4035. Up to 439 conditions per place. [2021-11-20 07:15:27,617 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 33 selfloop transitions, 7 changer transitions 40/156 dead transitions. [2021-11-20 07:15:27,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 156 transitions, 686 flow [2021-11-20 07:15:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:15:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 07:15:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2021-11-20 07:15:27,623 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2021-11-20 07:15:27,623 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2021-11-20 07:15:27,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2021-11-20 07:15:27,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:27,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2021-11-20 07:15:27,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 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 07:15:27,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 07:15:27,632 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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 07:15:27,633 INFO L186 Difference]: Start difference. First operand has 126 places, 98 transitions, 278 flow. Second operand 10 states and 976 transitions. [2021-11-20 07:15:27,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 156 transitions, 686 flow [2021-11-20 07:15:27,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 156 transitions, 660 flow, removed 3 selfloop flow, removed 9 redundant places. [2021-11-20 07:15:27,640 INFO L242 Difference]: Finished difference. Result has 126 places, 102 transitions, 320 flow [2021-11-20 07:15:27,641 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=126, PETRI_TRANSITIONS=102} [2021-11-20 07:15:27,642 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2021-11-20 07:15:27,643 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 102 transitions, 320 flow [2021-11-20 07:15:27,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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 07:15:27,644 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:27,644 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] [2021-11-20 07:15:27,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:15:27,644 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 07:15:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 671653969, now seen corresponding path program 1 times [2021-11-20 07:15:27,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:27,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655501861] [2021-11-20 07:15:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:27,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:27,786 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 07:15:27,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:27,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655501861] [2021-11-20 07:15:27,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655501861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:27,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:27,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:15:27,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434668830] [2021-11-20 07:15:27,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:27,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:15:27,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:15:27,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:15:27,791 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-20 07:15:27,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 102 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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 07:15:27,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:27,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-20 07:15:27,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:28,187 INFO L129 PetriNetUnfolder]: 304/845 cut-off events. [2021-11-20 07:15:28,188 INFO L130 PetriNetUnfolder]: For 2033/2062 co-relation queries the response was YES. [2021-11-20 07:15:28,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 845 events. 304/845 cut-off events. For 2033/2062 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4585 event pairs, 29 based on Foata normal form. 24/858 useless extension candidates. Maximal degree in co-relation 2695. Up to 206 conditions per place. [2021-11-20 07:15:28,197 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 41 selfloop transitions, 18 changer transitions 22/157 dead transitions. [2021-11-20 07:15:28,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 157 transitions, 871 flow [2021-11-20 07:15:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:15:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-20 07:15:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1071 transitions. [2021-11-20 07:15:28,202 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.854066985645933 [2021-11-20 07:15:28,202 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1071 transitions. [2021-11-20 07:15:28,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1071 transitions. [2021-11-20 07:15:28,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:28,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1071 transitions. [2021-11-20 07:15:28,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.36363636363636) internal successors, (1071), 11 states have internal predecessors, (1071), 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 07:15:28,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 07:15:28,212 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 07:15:28,212 INFO L186 Difference]: Start difference. First operand has 126 places, 102 transitions, 320 flow. Second operand 11 states and 1071 transitions. [2021-11-20 07:15:28,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 157 transitions, 871 flow [2021-11-20 07:15:28,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 157 transitions, 855 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-11-20 07:15:28,220 INFO L242 Difference]: Finished difference. Result has 134 places, 117 transitions, 497 flow [2021-11-20 07:15:28,221 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=497, PETRI_PLACES=134, PETRI_TRANSITIONS=117} [2021-11-20 07:15:28,221 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2021-11-20 07:15:28,222 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 117 transitions, 497 flow [2021-11-20 07:15:28,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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 07:15:28,222 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:28,223 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] [2021-11-20 07:15:28,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:15:28,223 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:15:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash 663676944, now seen corresponding path program 1 times [2021-11-20 07:15:28,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:28,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719747447] [2021-11-20 07:15:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:28,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:28,350 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 07:15:28,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:28,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719747447] [2021-11-20 07:15:28,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719747447] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:28,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:28,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 07:15:28,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299709837] [2021-11-20 07:15:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:28,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:15:28,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:15:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:15:28,354 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-11-20 07:15:28,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 117 transitions, 497 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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 07:15:28,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:28,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-11-20 07:15:28,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:28,783 INFO L129 PetriNetUnfolder]: 248/706 cut-off events. [2021-11-20 07:15:28,784 INFO L130 PetriNetUnfolder]: For 2579/2609 co-relation queries the response was YES. [2021-11-20 07:15:28,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 706 events. 248/706 cut-off events. For 2579/2609 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3939 event pairs, 18 based on Foata normal form. 10/705 useless extension candidates. Maximal degree in co-relation 2630. Up to 172 conditions per place. [2021-11-20 07:15:28,791 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 34 selfloop transitions, 22 changer transitions 24/156 dead transitions. [2021-11-20 07:15:28,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 941 flow [2021-11-20 07:15:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 07:15:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-20 07:15:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1332 transitions. [2021-11-20 07:15:28,798 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8345864661654135 [2021-11-20 07:15:28,799 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1332 transitions. [2021-11-20 07:15:28,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1332 transitions. [2021-11-20 07:15:28,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:28,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1332 transitions. [2021-11-20 07:15:28,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.14285714285714) internal successors, (1332), 14 states have internal predecessors, (1332), 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 07:15:28,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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 07:15:28,811 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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 07:15:28,811 INFO L186 Difference]: Start difference. First operand has 134 places, 117 transitions, 497 flow. Second operand 14 states and 1332 transitions. [2021-11-20 07:15:28,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 941 flow [2021-11-20 07:15:28,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 156 transitions, 871 flow, removed 31 selfloop flow, removed 3 redundant places. [2021-11-20 07:15:28,829 INFO L242 Difference]: Finished difference. Result has 151 places, 118 transitions, 515 flow [2021-11-20 07:15:28,829 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=515, PETRI_PLACES=151, PETRI_TRANSITIONS=118} [2021-11-20 07:15:28,831 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2021-11-20 07:15:28,831 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 118 transitions, 515 flow [2021-11-20 07:15:28,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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 07:15:28,832 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:28,832 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] [2021-11-20 07:15:28,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 07:15:28,833 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:15:28,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1319105514, now seen corresponding path program 1 times [2021-11-20 07:15:28,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:28,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307235995] [2021-11-20 07:15:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:28,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:15:29,322 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 07:15:29,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:15:29,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307235995] [2021-11-20 07:15:29,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307235995] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:15:29,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:15:29,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-20 07:15:29,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682851698] [2021-11-20 07:15:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:15:29,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 07:15:29,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:15:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 07:15:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:15:29,325 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2021-11-20 07:15:29,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 118 transitions, 515 flow. Second operand has 14 states, 14 states have (on average 86.71428571428571) internal successors, (1214), 14 states have internal predecessors, (1214), 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 07:15:29,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 07:15:29,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2021-11-20 07:15:29,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 07:15:29,737 INFO L129 PetriNetUnfolder]: 74/522 cut-off events. [2021-11-20 07:15:29,738 INFO L130 PetriNetUnfolder]: For 1328/1372 co-relation queries the response was YES. [2021-11-20 07:15:29,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 522 events. 74/522 cut-off events. For 1328/1372 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3613 event pairs, 0 based on Foata normal form. 4/508 useless extension candidates. Maximal degree in co-relation 1496. Up to 74 conditions per place. [2021-11-20 07:15:29,743 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 24 selfloop transitions, 5 changer transitions 10/130 dead transitions. [2021-11-20 07:15:29,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 130 transitions, 645 flow [2021-11-20 07:15:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:15:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-20 07:15:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 972 transitions. [2021-11-20 07:15:29,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7751196172248804 [2021-11-20 07:15:29,746 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 972 transitions. [2021-11-20 07:15:29,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 972 transitions. [2021-11-20 07:15:29,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 07:15:29,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 972 transitions. [2021-11-20 07:15:29,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.36363636363636) internal successors, (972), 11 states have internal predecessors, (972), 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 07:15:29,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 07:15:29,754 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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 07:15:29,754 INFO L186 Difference]: Start difference. First operand has 151 places, 118 transitions, 515 flow. Second operand 11 states and 972 transitions. [2021-11-20 07:15:29,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 130 transitions, 645 flow [2021-11-20 07:15:29,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 130 transitions, 531 flow, removed 39 selfloop flow, removed 16 redundant places. [2021-11-20 07:15:29,768 INFO L242 Difference]: Finished difference. Result has 147 places, 117 transitions, 436 flow [2021-11-20 07:15:29,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=436, PETRI_PLACES=147, PETRI_TRANSITIONS=117} [2021-11-20 07:15:29,770 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2021-11-20 07:15:29,770 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 117 transitions, 436 flow [2021-11-20 07:15:29,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.71428571428571) internal successors, (1214), 14 states have internal predecessors, (1214), 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 07:15:29,771 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 07:15:29,771 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] [2021-11-20 07:15:29,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:15:29,772 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-20 07:15:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:15:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2018009374, now seen corresponding path program 2 times [2021-11-20 07:15:29,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:15:29,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651669791] [2021-11-20 07:15:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:15:29,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:15:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:15:29,840 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:15:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:15:29,974 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:15:29,974 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:15:29,975 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-20 07:15:29,977 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-20 07:15:29,977 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-11-20 07:15:29,977 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-11-20 07:15:29,977 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-11-20 07:15:29,978 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-20 07:15:29,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 07:15:29,982 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:15:29,988 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-20 07:15:29,988 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:15:30,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:15:30 BasicIcfg [2021-11-20 07:15:30,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:15:30,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:15:30,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:15:30,171 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:15:30,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:15:19" (3/4) ... [2021-11-20 07:15:30,173 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 07:15:30,290 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:15:30,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:15:30,291 INFO L158 Benchmark]: Toolchain (without parser) took 12659.55ms. Allocated memory was 94.4MB in the beginning and 295.7MB in the end (delta: 201.3MB). Free memory was 56.3MB in the beginning and 174.1MB in the end (delta: -117.9MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,291 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 94.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:15:30,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.97ms. Allocated memory is still 94.4MB. Free memory was 56.1MB in the beginning and 59.8MB in the end (delta: -3.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.66ms. Allocated memory is still 94.4MB. Free memory was 59.8MB in the beginning and 56.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,292 INFO L158 Benchmark]: Boogie Preprocessor took 41.73ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,293 INFO L158 Benchmark]: RCFGBuilder took 1195.60ms. Allocated memory is still 94.4MB. Free memory was 54.8MB in the beginning and 56.6MB in the end (delta: -1.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,293 INFO L158 Benchmark]: TraceAbstraction took 10552.99ms. Allocated memory was 94.4MB in the beginning and 295.7MB in the end (delta: 201.3MB). Free memory was 56.1MB in the beginning and 202.5MB in the end (delta: -146.4MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,294 INFO L158 Benchmark]: Witness Printer took 120.12ms. Allocated memory is still 295.7MB. Free memory was 202.5MB in the beginning and 174.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-20 07:15:30,296 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.32ms. Allocated memory is still 94.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.97ms. Allocated memory is still 94.4MB. Free memory was 56.1MB in the beginning and 59.8MB in the end (delta: -3.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.66ms. Allocated memory is still 94.4MB. Free memory was 59.8MB in the beginning and 56.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.73ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1195.60ms. Allocated memory is still 94.4MB. Free memory was 54.8MB in the beginning and 56.6MB in the end (delta: -1.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10552.99ms. Allocated memory was 94.4MB in the beginning and 295.7MB in the end (delta: 201.3MB). Free memory was 56.1MB in the beginning and 202.5MB in the end (delta: -146.4MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. * Witness Printer took 120.12ms. Allocated memory is still 295.7MB. Free memory was 202.5MB in the beginning and 174.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L818] 0 pthread_t t1804; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804={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] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1804, ((void *)0), P0, ((void *)0))=-2, t1804={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] [L820] 0 pthread_t t1805; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={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] [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1805, ((void *)0), P1, ((void *)0))=-1, t1804={5:0}, t1805={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] [L822] 0 pthread_t t1806; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1806, ((void *)0), P2, ((void *)0))=0, t1804={5:0}, t1805={6:0}, t1806={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=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L747] 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) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L796] 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) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] 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) [L796] 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) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 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 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={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=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={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=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, 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=2] - 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: 819]: 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: 823]: 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: 821]: 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, 141 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.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 581 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1036 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1457 IncrementalHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 111 mSDtfsCounter, 1457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=12, InterpolantAutomatonStates: 121, 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.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1102 NumberOfCodeBlocks, 1102 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1001 ConstructedInterpolants, 0 QuantifiedInterpolants, 3968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 07:15:30,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21c3057c-68be-48a4-862f-05df94d9f73c/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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