./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa --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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:39:34,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:39:34,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:39:34,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:39:34,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:39:34,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:39:34,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:39:34,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:39:34,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:39:34,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:39:34,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:39:34,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:39:34,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:39:34,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:39:34,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:39:34,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:39:34,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:39:34,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:39:34,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:39:34,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:39:34,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:39:34,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:39:34,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:39:34,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:39:34,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:39:34,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:39:34,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:39:34,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:39:34,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:39:34,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:39:34,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:39:34,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:39:34,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:39:34,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:39:34,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:39:34,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:39:34,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:39:34,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:39:34,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:39:34,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:39:34,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:39:34,409 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:39:34,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:39:34,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:39:34,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:39:34,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:39:34,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:39:34,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:39:34,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:39:34,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:39:34,429 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:39:34,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:39:34,429 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:39:34,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:39:34,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:39:34,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:39:34,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:39:34,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:39:34,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:39:34,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:39:34,432 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:39:34,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:39:34,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:39:34,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:39:34,432 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_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/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_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2021-12-06 22:39:34,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:39:34,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:39:34,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:39:34,628 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:39:34,628 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:39:34,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2021-12-06 22:39:34,673 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/data/34bf4da9f/7d7ad660ebfe49c89eb5f3bfdc4921b8/FLAG7d3250d1d [2021-12-06 22:39:35,095 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:39:35,095 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2021-12-06 22:39:35,108 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/data/34bf4da9f/7d7ad660ebfe49c89eb5f3bfdc4921b8/FLAG7d3250d1d [2021-12-06 22:39:35,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/data/34bf4da9f/7d7ad660ebfe49c89eb5f3bfdc4921b8 [2021-12-06 22:39:35,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:39:35,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:39:35,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:39:35,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:39:35,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:39:35,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b94ce8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35, skipping insertion in model container [2021-12-06 22:39:35,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:39:35,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:39:35,315 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_c643e3e3-868a-434e-a7dc-4c100348582a/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2021-12-06 22:39:35,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:39:35,435 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:39:35,444 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_c643e3e3-868a-434e-a7dc-4c100348582a/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2021-12-06 22:39:35,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:39:35,510 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:39:35,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35 WrapperNode [2021-12-06 22:39:35,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:39:35,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:39:35,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:39:35,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:39:35,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,554 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2021-12-06 22:39:35,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:39:35,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:39:35,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:39:35,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:39:35,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:39:35,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:39:35,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:39:35,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:39:35,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (1/1) ... [2021-12-06 22:39:35,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:39:35,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:39:35,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:39:35,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:39:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 22:39:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 22:39:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:39:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 22:39:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:39:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 22:39:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 22:39:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 22:39:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 22:39:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 22:39:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 22:39:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-06 22:39:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-06 22:39:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:39:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 22:39:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:39:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:39:35,656 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 22:39:35,746 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:39:35,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:39:36,091 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:39:36,303 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:39:36,303 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 22:39:36,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:39:36 BoogieIcfgContainer [2021-12-06 22:39:36,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:39:36,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:39:36,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:39:36,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:39:36,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:39:35" (1/3) ... [2021-12-06 22:39:36,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79512bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:39:36, skipping insertion in model container [2021-12-06 22:39:36,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:39:35" (2/3) ... [2021-12-06 22:39:36,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79512bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:39:36, skipping insertion in model container [2021-12-06 22:39:36,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:39:36" (3/3) ... [2021-12-06 22:39:36,311 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2021-12-06 22:39:36,315 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 22:39:36,315 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:39:36,315 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 22:39:36,316 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 22:39:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,345 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,345 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,346 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,346 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,346 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,346 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,347 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,348 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,348 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,348 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,349 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,350 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,351 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,354 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,355 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,355 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,356 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,367 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,367 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,367 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,368 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,368 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,368 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,368 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,370 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,371 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,371 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,371 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,372 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,373 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,373 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,373 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,373 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,374 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,375 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,375 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,376 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,377 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,377 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:39:36,377 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 22:39:36,413 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:39:36,418 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-12-06 22:39:36,419 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-06 22:39:36,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2021-12-06 22:39:36,469 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2021-12-06 22:39:36,470 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 22:39:36,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2021-12-06 22:39:36,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2021-12-06 22:39:36,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2021-12-06 22:39:36,490 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2021-12-06 22:39:36,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 22:39:36,490 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:36,491 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] [2021-12-06 22:39:36,491 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1118078414, now seen corresponding path program 1 times [2021-12-06 22:39:36,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:36,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759296768] [2021-12-06 22:39:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:36,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:36,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:36,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759296768] [2021-12-06 22:39:36,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759296768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:36,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:36,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:39:36,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706218660] [2021-12-06 22:39:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:36,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:39:36,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:36,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:39:36,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:39:36,774 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2021-12-06 22:39:36,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-12-06 22:39:36,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:36,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2021-12-06 22:39:36,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:36,977 INFO L129 PetriNetUnfolder]: 57/522 cut-off events. [2021-12-06 22:39:36,977 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-06 22:39:36,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 522 events. 57/522 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2652 event pairs, 31 based on Foata normal form. 15/507 useless extension candidates. Maximal degree in co-relation 595. Up to 75 conditions per place. [2021-12-06 22:39:36,984 INFO L132 encePairwiseOnDemand]: 129/134 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2021-12-06 22:39:36,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 131 transitions, 309 flow [2021-12-06 22:39:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:39:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:39:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2021-12-06 22:39:36,997 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2021-12-06 22:39:36,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2021-12-06 22:39:36,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2021-12-06 22:39:37,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:37,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2021-12-06 22:39:37,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-12-06 22:39:37,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-12-06 22:39:37,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-12-06 22:39:37,015 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 3 states and 378 transitions. [2021-12-06 22:39:37,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 131 transitions, 309 flow [2021-12-06 22:39:37,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 22:39:37,022 INFO L242 Difference]: Finished difference. Result has 137 places, 126 transitions, 264 flow [2021-12-06 22:39:37,023 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2021-12-06 22:39:37,027 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, -4 predicate places. [2021-12-06 22:39:37,027 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 264 flow [2021-12-06 22:39:37,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-12-06 22:39:37,028 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:37,028 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:37,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:39:37,028 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1709840169, now seen corresponding path program 1 times [2021-12-06 22:39:37,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:37,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873200942] [2021-12-06 22:39:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:37,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:37,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:37,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873200942] [2021-12-06 22:39:37,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873200942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:37,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:37,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:39:37,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592141613] [2021-12-06 22:39:37,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:37,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:39:37,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:39:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:39:37,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2021-12-06 22:39:37,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 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-12-06 22:39:37,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:37,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2021-12-06 22:39:37,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:37,844 INFO L129 PetriNetUnfolder]: 954/2701 cut-off events. [2021-12-06 22:39:37,844 INFO L130 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2021-12-06 22:39:37,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 2701 events. 954/2701 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 21810 event pairs, 125 based on Foata normal form. 0/2632 useless extension candidates. Maximal degree in co-relation 4268. Up to 816 conditions per place. [2021-12-06 22:39:37,861 INFO L132 encePairwiseOnDemand]: 127/134 looper letters, 24 selfloop transitions, 3 changer transitions 56/177 dead transitions. [2021-12-06 22:39:37,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 177 transitions, 526 flow [2021-12-06 22:39:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:39:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:39:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2021-12-06 22:39:37,866 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2021-12-06 22:39:37,866 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2021-12-06 22:39:37,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2021-12-06 22:39:37,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:37,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2021-12-06 22:39:37,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 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-12-06 22:39:37,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-12-06 22:39:37,874 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-12-06 22:39:37,875 INFO L186 Difference]: Start difference. First operand has 137 places, 126 transitions, 264 flow. Second operand 9 states and 1071 transitions. [2021-12-06 22:39:37,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 177 transitions, 526 flow [2021-12-06 22:39:37,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 177 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 22:39:37,878 INFO L242 Difference]: Finished difference. Result has 150 places, 114 transitions, 275 flow [2021-12-06 22:39:37,879 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2021-12-06 22:39:37,879 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 9 predicate places. [2021-12-06 22:39:37,879 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 275 flow [2021-12-06 22:39:37,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 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-12-06 22:39:37,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:37,880 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:37,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:39:37,880 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1673744296, now seen corresponding path program 1 times [2021-12-06 22:39:37,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004824231] [2021-12-06 22:39:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:37,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:38,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:38,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004824231] [2021-12-06 22:39:38,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004824231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:38,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:38,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:39:38,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692710991] [2021-12-06 22:39:38,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:38,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:39:38,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:39:38,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:39:38,085 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-06 22:39:38,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 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-12-06 22:39:38,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:38,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-06 22:39:38,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:38,640 INFO L129 PetriNetUnfolder]: 796/1593 cut-off events. [2021-12-06 22:39:38,640 INFO L130 PetriNetUnfolder]: For 1323/1334 co-relation queries the response was YES. [2021-12-06 22:39:38,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 1593 events. 796/1593 cut-off events. For 1323/1334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10433 event pairs, 201 based on Foata normal form. 45/1563 useless extension candidates. Maximal degree in co-relation 3675. Up to 661 conditions per place. [2021-12-06 22:39:38,655 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 21 selfloop transitions, 10 changer transitions 43/169 dead transitions. [2021-12-06 22:39:38,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 169 transitions, 567 flow [2021-12-06 22:39:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 22:39:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 22:39:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1617 transitions. [2021-12-06 22:39:38,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8619402985074627 [2021-12-06 22:39:38,662 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1617 transitions. [2021-12-06 22:39:38,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1617 transitions. [2021-12-06 22:39:38,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:38,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1617 transitions. [2021-12-06 22:39:38,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.5) internal successors, (1617), 14 states have internal predecessors, (1617), 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-12-06 22:39:38,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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-12-06 22:39:38,675 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 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-12-06 22:39:38,676 INFO L186 Difference]: Start difference. First operand has 150 places, 114 transitions, 275 flow. Second operand 14 states and 1617 transitions. [2021-12-06 22:39:38,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 169 transitions, 567 flow [2021-12-06 22:39:38,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 169 transitions, 546 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-06 22:39:38,688 INFO L242 Difference]: Finished difference. Result has 150 places, 121 transitions, 363 flow [2021-12-06 22:39:38,689 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=363, PETRI_PLACES=150, PETRI_TRANSITIONS=121} [2021-12-06 22:39:38,689 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 9 predicate places. [2021-12-06 22:39:38,690 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 121 transitions, 363 flow [2021-12-06 22:39:38,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 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-12-06 22:39:38,690 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:38,691 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:38,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:39:38,691 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1853610587, now seen corresponding path program 1 times [2021-12-06 22:39:38,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:38,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440061805] [2021-12-06 22:39:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:38,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:38,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:38,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440061805] [2021-12-06 22:39:38,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440061805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:38,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:38,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:39:38,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299542078] [2021-12-06 22:39:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:38,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:39:38,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:39:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:39:38,831 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2021-12-06 22:39:38,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 121 transitions, 363 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-12-06 22:39:38,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:38,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2021-12-06 22:39:38,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:39,304 INFO L129 PetriNetUnfolder]: 686/1426 cut-off events. [2021-12-06 22:39:39,305 INFO L130 PetriNetUnfolder]: For 5042/5238 co-relation queries the response was YES. [2021-12-06 22:39:39,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5358 conditions, 1426 events. 686/1426 cut-off events. For 5042/5238 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9034 event pairs, 95 based on Foata normal form. 31/1398 useless extension candidates. Maximal degree in co-relation 5283. Up to 546 conditions per place. [2021-12-06 22:39:39,323 INFO L132 encePairwiseOnDemand]: 124/134 looper letters, 32 selfloop transitions, 8 changer transitions 37/173 dead transitions. [2021-12-06 22:39:39,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 173 transitions, 883 flow [2021-12-06 22:39:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1517 transitions. [2021-12-06 22:39:39,328 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8708381171067738 [2021-12-06 22:39:39,328 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1517 transitions. [2021-12-06 22:39:39,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1517 transitions. [2021-12-06 22:39:39,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:39,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1517 transitions. [2021-12-06 22:39:39,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.6923076923077) internal successors, (1517), 13 states have internal predecessors, (1517), 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-12-06 22:39:39,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:39,336 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:39,336 INFO L186 Difference]: Start difference. First operand has 150 places, 121 transitions, 363 flow. Second operand 13 states and 1517 transitions. [2021-12-06 22:39:39,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 173 transitions, 883 flow [2021-12-06 22:39:39,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 173 transitions, 857 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-12-06 22:39:39,344 INFO L242 Difference]: Finished difference. Result has 159 places, 125 transitions, 440 flow [2021-12-06 22:39:39,345 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=159, PETRI_TRANSITIONS=125} [2021-12-06 22:39:39,345 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 18 predicate places. [2021-12-06 22:39:39,345 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 125 transitions, 440 flow [2021-12-06 22:39:39,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-12-06 22:39:39,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:39,346 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:39,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:39:39,346 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1315755009, now seen corresponding path program 2 times [2021-12-06 22:39:39,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:39,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112249578] [2021-12-06 22:39:39,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:39,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:39,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112249578] [2021-12-06 22:39:39,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112249578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:39,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:39,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:39:39,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860504879] [2021-12-06 22:39:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:39,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:39:39,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:39:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:39:39,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-06 22:39:39,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 125 transitions, 440 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 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-12-06 22:39:39,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:39,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-06 22:39:39,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:39,940 INFO L129 PetriNetUnfolder]: 580/1328 cut-off events. [2021-12-06 22:39:39,940 INFO L130 PetriNetUnfolder]: For 9269/9483 co-relation queries the response was YES. [2021-12-06 22:39:39,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 1328 events. 580/1328 cut-off events. For 9269/9483 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8279 event pairs, 127 based on Foata normal form. 31/1283 useless extension candidates. Maximal degree in co-relation 6043. Up to 506 conditions per place. [2021-12-06 22:39:39,959 INFO L132 encePairwiseOnDemand]: 126/134 looper letters, 32 selfloop transitions, 6 changer transitions 25/158 dead transitions. [2021-12-06 22:39:39,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 158 transitions, 940 flow [2021-12-06 22:39:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:39:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 22:39:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1266 transitions. [2021-12-06 22:39:39,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.858887381275441 [2021-12-06 22:39:39,964 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1266 transitions. [2021-12-06 22:39:39,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1266 transitions. [2021-12-06 22:39:39,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:39,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1266 transitions. [2021-12-06 22:39:39,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.0909090909091) internal successors, (1266), 11 states have internal predecessors, (1266), 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-12-06 22:39:39,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 134.0) internal successors, (1608), 12 states have internal predecessors, (1608), 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-12-06 22:39:39,973 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 134.0) internal successors, (1608), 12 states have internal predecessors, (1608), 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-12-06 22:39:39,973 INFO L186 Difference]: Start difference. First operand has 159 places, 125 transitions, 440 flow. Second operand 11 states and 1266 transitions. [2021-12-06 22:39:39,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 158 transitions, 940 flow [2021-12-06 22:39:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 158 transitions, 879 flow, removed 27 selfloop flow, removed 7 redundant places. [2021-12-06 22:39:39,987 INFO L242 Difference]: Finished difference. Result has 160 places, 125 transitions, 433 flow [2021-12-06 22:39:39,987 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=433, PETRI_PLACES=160, PETRI_TRANSITIONS=125} [2021-12-06 22:39:39,988 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 19 predicate places. [2021-12-06 22:39:39,988 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 125 transitions, 433 flow [2021-12-06 22:39:39,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 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-12-06 22:39:39,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:39,989 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-12-06 22:39:39,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 22:39:39,990 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash -456035482, now seen corresponding path program 1 times [2021-12-06 22:39:39,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:39,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492784446] [2021-12-06 22:39:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:39,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:40,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:40,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492784446] [2021-12-06 22:39:40,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492784446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:40,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:40,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 22:39:40,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076329620] [2021-12-06 22:39:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:40,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 22:39:40,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:40,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 22:39:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-06 22:39:40,167 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:40,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 125 transitions, 433 flow. Second operand has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 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-12-06 22:39:40,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:40,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:40,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:40,647 INFO L129 PetriNetUnfolder]: 564/1256 cut-off events. [2021-12-06 22:39:40,647 INFO L130 PetriNetUnfolder]: For 8639/8913 co-relation queries the response was YES. [2021-12-06 22:39:40,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 1256 events. 564/1256 cut-off events. For 8639/8913 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7881 event pairs, 87 based on Foata normal form. 42/1230 useless extension candidates. Maximal degree in co-relation 5753. Up to 506 conditions per place. [2021-12-06 22:39:40,666 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 27 selfloop transitions, 12 changer transitions 29/161 dead transitions. [2021-12-06 22:39:40,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 931 flow [2021-12-06 22:39:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1466 transitions. [2021-12-06 22:39:40,670 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8415614236509759 [2021-12-06 22:39:40,670 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1466 transitions. [2021-12-06 22:39:40,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1466 transitions. [2021-12-06 22:39:40,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:40,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1466 transitions. [2021-12-06 22:39:40,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.76923076923077) internal successors, (1466), 13 states have internal predecessors, (1466), 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-12-06 22:39:40,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:40,678 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:40,678 INFO L186 Difference]: Start difference. First operand has 160 places, 125 transitions, 433 flow. Second operand 13 states and 1466 transitions. [2021-12-06 22:39:40,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 931 flow [2021-12-06 22:39:40,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 874 flow, removed 24 selfloop flow, removed 12 redundant places. [2021-12-06 22:39:40,689 INFO L242 Difference]: Finished difference. Result has 161 places, 127 transitions, 494 flow [2021-12-06 22:39:40,689 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=494, PETRI_PLACES=161, PETRI_TRANSITIONS=127} [2021-12-06 22:39:40,690 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 20 predicate places. [2021-12-06 22:39:40,690 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 127 transitions, 494 flow [2021-12-06 22:39:40,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.7) internal successors, (1097), 10 states have internal predecessors, (1097), 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-12-06 22:39:40,691 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:40,691 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:40,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 22:39:40,691 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1576804131, now seen corresponding path program 1 times [2021-12-06 22:39:40,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:40,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002465497] [2021-12-06 22:39:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:40,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:40,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002465497] [2021-12-06 22:39:40,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002465497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:40,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:40,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 22:39:40,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668727573] [2021-12-06 22:39:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:40,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 22:39:40,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:40,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 22:39:40,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-06 22:39:40,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2021-12-06 22:39:40,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 127 transitions, 494 flow. Second operand has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 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-12-06 22:39:40,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:40,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2021-12-06 22:39:40,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:41,360 INFO L129 PetriNetUnfolder]: 502/1212 cut-off events. [2021-12-06 22:39:41,360 INFO L130 PetriNetUnfolder]: For 12979/13185 co-relation queries the response was YES. [2021-12-06 22:39:41,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 1212 events. 502/1212 cut-off events. For 12979/13185 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7495 event pairs, 57 based on Foata normal form. 45/1198 useless extension candidates. Maximal degree in co-relation 6317. Up to 469 conditions per place. [2021-12-06 22:39:41,378 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 32 selfloop transitions, 12 changer transitions 25/163 dead transitions. [2021-12-06 22:39:41,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 163 transitions, 1140 flow [2021-12-06 22:39:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:39:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 22:39:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1371 transitions. [2021-12-06 22:39:41,382 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8526119402985075 [2021-12-06 22:39:41,382 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1371 transitions. [2021-12-06 22:39:41,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1371 transitions. [2021-12-06 22:39:41,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:41,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1371 transitions. [2021-12-06 22:39:41,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.25) internal successors, (1371), 12 states have internal predecessors, (1371), 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-12-06 22:39:41,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 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-12-06 22:39:41,389 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 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-12-06 22:39:41,389 INFO L186 Difference]: Start difference. First operand has 161 places, 127 transitions, 494 flow. Second operand 12 states and 1371 transitions. [2021-12-06 22:39:41,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 163 transitions, 1140 flow [2021-12-06 22:39:41,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 163 transitions, 1089 flow, removed 17 selfloop flow, removed 8 redundant places. [2021-12-06 22:39:41,397 INFO L242 Difference]: Finished difference. Result has 165 places, 130 transitions, 571 flow [2021-12-06 22:39:41,398 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=571, PETRI_PLACES=165, PETRI_TRANSITIONS=130} [2021-12-06 22:39:41,398 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 24 predicate places. [2021-12-06 22:39:41,398 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 130 transitions, 571 flow [2021-12-06 22:39:41,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 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-12-06 22:39:41,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:41,399 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:41,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 22:39:41,399 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:41,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:41,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1134362339, now seen corresponding path program 2 times [2021-12-06 22:39:41,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:41,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328233842] [2021-12-06 22:39:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:41,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:41,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:41,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328233842] [2021-12-06 22:39:41,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328233842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:41,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:41,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 22:39:41,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269641788] [2021-12-06 22:39:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:41,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 22:39:41,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 22:39:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:39:41,581 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:41,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 130 transitions, 571 flow. Second operand has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 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-12-06 22:39:41,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:41,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:41,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:42,113 INFO L129 PetriNetUnfolder]: 510/1222 cut-off events. [2021-12-06 22:39:42,114 INFO L130 PetriNetUnfolder]: For 23328/23677 co-relation queries the response was YES. [2021-12-06 22:39:42,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8078 conditions, 1222 events. 510/1222 cut-off events. For 23328/23677 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7665 event pairs, 104 based on Foata normal form. 33/1190 useless extension candidates. Maximal degree in co-relation 7987. Up to 477 conditions per place. [2021-12-06 22:39:42,133 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 33 selfloop transitions, 18 changer transitions 25/169 dead transitions. [2021-12-06 22:39:42,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 169 transitions, 1484 flow [2021-12-06 22:39:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1468 transitions. [2021-12-06 22:39:42,137 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8427095292766934 [2021-12-06 22:39:42,137 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1468 transitions. [2021-12-06 22:39:42,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1468 transitions. [2021-12-06 22:39:42,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:42,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1468 transitions. [2021-12-06 22:39:42,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.92307692307692) internal successors, (1468), 13 states have internal predecessors, (1468), 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-12-06 22:39:42,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:42,144 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:42,144 INFO L186 Difference]: Start difference. First operand has 165 places, 130 transitions, 571 flow. Second operand 13 states and 1468 transitions. [2021-12-06 22:39:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 169 transitions, 1484 flow [2021-12-06 22:39:42,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 169 transitions, 1286 flow, removed 88 selfloop flow, removed 10 redundant places. [2021-12-06 22:39:42,159 INFO L242 Difference]: Finished difference. Result has 169 places, 136 transitions, 697 flow [2021-12-06 22:39:42,159 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=697, PETRI_PLACES=169, PETRI_TRANSITIONS=136} [2021-12-06 22:39:42,160 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 28 predicate places. [2021-12-06 22:39:42,160 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 136 transitions, 697 flow [2021-12-06 22:39:42,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 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-12-06 22:39:42,161 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:42,161 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:42,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 22:39:42,161 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 828271909, now seen corresponding path program 3 times [2021-12-06 22:39:42,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186949471] [2021-12-06 22:39:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:42,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:42,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:42,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186949471] [2021-12-06 22:39:42,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186949471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:42,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:42,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 22:39:42,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288167032] [2021-12-06 22:39:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:42,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 22:39:42,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 22:39:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:39:42,356 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2021-12-06 22:39:42,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 136 transitions, 697 flow. Second operand has 11 states, 11 states have (on average 108.72727272727273) internal successors, (1196), 11 states have internal predecessors, (1196), 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-12-06 22:39:42,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:42,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2021-12-06 22:39:42,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:42,843 INFO L129 PetriNetUnfolder]: 566/1328 cut-off events. [2021-12-06 22:39:42,843 INFO L130 PetriNetUnfolder]: For 35850/36223 co-relation queries the response was YES. [2021-12-06 22:39:42,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10174 conditions, 1328 events. 566/1328 cut-off events. For 35850/36223 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8289 event pairs, 116 based on Foata normal form. 33/1291 useless extension candidates. Maximal degree in co-relation 10079. Up to 466 conditions per place. [2021-12-06 22:39:42,864 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 44 selfloop transitions, 13 changer transitions 25/174 dead transitions. [2021-12-06 22:39:42,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 174 transitions, 1727 flow [2021-12-06 22:39:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1454 transitions. [2021-12-06 22:39:42,868 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8346727898966705 [2021-12-06 22:39:42,868 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1454 transitions. [2021-12-06 22:39:42,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1454 transitions. [2021-12-06 22:39:42,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:42,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1454 transitions. [2021-12-06 22:39:42,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.84615384615384) internal successors, (1454), 13 states have internal predecessors, (1454), 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-12-06 22:39:42,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:42,874 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:42,874 INFO L186 Difference]: Start difference. First operand has 169 places, 136 transitions, 697 flow. Second operand 13 states and 1454 transitions. [2021-12-06 22:39:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 174 transitions, 1727 flow [2021-12-06 22:39:42,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 174 transitions, 1306 flow, removed 204 selfloop flow, removed 12 redundant places. [2021-12-06 22:39:42,894 INFO L242 Difference]: Finished difference. Result has 170 places, 139 transitions, 686 flow [2021-12-06 22:39:42,895 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=686, PETRI_PLACES=170, PETRI_TRANSITIONS=139} [2021-12-06 22:39:42,895 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 29 predicate places. [2021-12-06 22:39:42,895 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 139 transitions, 686 flow [2021-12-06 22:39:42,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 108.72727272727273) internal successors, (1196), 11 states have internal predecessors, (1196), 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-12-06 22:39:42,896 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:42,896 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:42,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 22:39:42,896 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1133402315, now seen corresponding path program 1 times [2021-12-06 22:39:42,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315981255] [2021-12-06 22:39:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:42,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:43,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:43,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315981255] [2021-12-06 22:39:43,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315981255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:43,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:43,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 22:39:43,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747313831] [2021-12-06 22:39:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:43,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 22:39:43,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:43,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 22:39:43,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-06 22:39:43,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:43,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 139 transitions, 686 flow. Second operand has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 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-12-06 22:39:43,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:43,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:43,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:43,492 INFO L129 PetriNetUnfolder]: 512/1382 cut-off events. [2021-12-06 22:39:43,492 INFO L130 PetriNetUnfolder]: For 24185/25043 co-relation queries the response was YES. [2021-12-06 22:39:43,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9079 conditions, 1382 events. 512/1382 cut-off events. For 24185/25043 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9379 event pairs, 79 based on Foata normal form. 21/1340 useless extension candidates. Maximal degree in co-relation 8986. Up to 509 conditions per place. [2021-12-06 22:39:43,512 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 43 selfloop transitions, 21 changer transitions 19/176 dead transitions. [2021-12-06 22:39:43,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 176 transitions, 1599 flow [2021-12-06 22:39:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1463 transitions. [2021-12-06 22:39:43,515 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8398392652123995 [2021-12-06 22:39:43,515 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1463 transitions. [2021-12-06 22:39:43,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1463 transitions. [2021-12-06 22:39:43,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:43,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1463 transitions. [2021-12-06 22:39:43,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.53846153846153) internal successors, (1463), 13 states have internal predecessors, (1463), 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-12-06 22:39:43,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:43,521 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:43,522 INFO L186 Difference]: Start difference. First operand has 170 places, 139 transitions, 686 flow. Second operand 13 states and 1463 transitions. [2021-12-06 22:39:43,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 176 transitions, 1599 flow [2021-12-06 22:39:43,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 176 transitions, 1350 flow, removed 119 selfloop flow, removed 10 redundant places. [2021-12-06 22:39:43,536 INFO L242 Difference]: Finished difference. Result has 174 places, 148 transitions, 875 flow [2021-12-06 22:39:43,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=875, PETRI_PLACES=174, PETRI_TRANSITIONS=148} [2021-12-06 22:39:43,537 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 33 predicate places. [2021-12-06 22:39:43,537 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 148 transitions, 875 flow [2021-12-06 22:39:43,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 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-12-06 22:39:43,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:43,538 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:43,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 22:39:43,538 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1537707799, now seen corresponding path program 2 times [2021-12-06 22:39:43,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:43,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237538502] [2021-12-06 22:39:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:43,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:43,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237538502] [2021-12-06 22:39:43,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237538502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:43,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:43,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 22:39:43,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857153804] [2021-12-06 22:39:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:43,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 22:39:43,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:43,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 22:39:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:39:43,752 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2021-12-06 22:39:43,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 148 transitions, 875 flow. Second operand has 14 states, 14 states have (on average 108.42857142857143) internal successors, (1518), 14 states have internal predecessors, (1518), 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-12-06 22:39:43,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:43,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2021-12-06 22:39:43,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:44,298 INFO L129 PetriNetUnfolder]: 569/1587 cut-off events. [2021-12-06 22:39:44,298 INFO L130 PetriNetUnfolder]: For 21664/22305 co-relation queries the response was YES. [2021-12-06 22:39:44,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9249 conditions, 1587 events. 569/1587 cut-off events. For 21664/22305 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11207 event pairs, 87 based on Foata normal form. 39/1551 useless extension candidates. Maximal degree in co-relation 9153. Up to 687 conditions per place. [2021-12-06 22:39:44,324 INFO L132 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 27 changer transitions 13/181 dead transitions. [2021-12-06 22:39:44,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 181 transitions, 1609 flow [2021-12-06 22:39:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1446 transitions. [2021-12-06 22:39:44,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8300803673938002 [2021-12-06 22:39:44,327 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1446 transitions. [2021-12-06 22:39:44,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1446 transitions. [2021-12-06 22:39:44,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:44,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1446 transitions. [2021-12-06 22:39:44,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.23076923076923) internal successors, (1446), 13 states have internal predecessors, (1446), 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-12-06 22:39:44,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:44,332 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:44,332 INFO L186 Difference]: Start difference. First operand has 174 places, 148 transitions, 875 flow. Second operand 13 states and 1446 transitions. [2021-12-06 22:39:44,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 181 transitions, 1609 flow [2021-12-06 22:39:44,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 181 transitions, 1482 flow, removed 61 selfloop flow, removed 9 redundant places. [2021-12-06 22:39:44,350 INFO L242 Difference]: Finished difference. Result has 176 places, 159 transitions, 1063 flow [2021-12-06 22:39:44,351 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1063, PETRI_PLACES=176, PETRI_TRANSITIONS=159} [2021-12-06 22:39:44,351 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 35 predicate places. [2021-12-06 22:39:44,351 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 159 transitions, 1063 flow [2021-12-06 22:39:44,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.42857142857143) internal successors, (1518), 14 states have internal predecessors, (1518), 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-12-06 22:39:44,352 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:44,352 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:44,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 22:39:44,352 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1964833303, now seen corresponding path program 3 times [2021-12-06 22:39:44,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164210792] [2021-12-06 22:39:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:44,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:44,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:44,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164210792] [2021-12-06 22:39:44,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164210792] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:44,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:44,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 22:39:44,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719274951] [2021-12-06 22:39:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:44,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 22:39:44,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 22:39:44,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:39:44,567 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2021-12-06 22:39:44,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 159 transitions, 1063 flow. Second operand has 13 states, 13 states have (on average 108.53846153846153) internal successors, (1411), 13 states have internal predecessors, (1411), 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-12-06 22:39:44,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:44,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2021-12-06 22:39:44,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:45,163 INFO L129 PetriNetUnfolder]: 548/1458 cut-off events. [2021-12-06 22:39:45,163 INFO L130 PetriNetUnfolder]: For 20849/23244 co-relation queries the response was YES. [2021-12-06 22:39:45,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9020 conditions, 1458 events. 548/1458 cut-off events. For 20849/23244 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10041 event pairs, 59 based on Foata normal form. 73/1470 useless extension candidates. Maximal degree in co-relation 8922. Up to 600 conditions per place. [2021-12-06 22:39:45,186 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 54 selfloop transitions, 32 changer transitions 19/197 dead transitions. [2021-12-06 22:39:45,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 197 transitions, 1897 flow [2021-12-06 22:39:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 22:39:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 22:39:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1673 transitions. [2021-12-06 22:39:45,188 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8323383084577114 [2021-12-06 22:39:45,188 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1673 transitions. [2021-12-06 22:39:45,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1673 transitions. [2021-12-06 22:39:45,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:45,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1673 transitions. [2021-12-06 22:39:45,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 111.53333333333333) internal successors, (1673), 15 states have internal predecessors, (1673), 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-12-06 22:39:45,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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-12-06 22:39:45,193 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 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-12-06 22:39:45,193 INFO L186 Difference]: Start difference. First operand has 176 places, 159 transitions, 1063 flow. Second operand 15 states and 1673 transitions. [2021-12-06 22:39:45,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 197 transitions, 1897 flow [2021-12-06 22:39:45,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 197 transitions, 1733 flow, removed 62 selfloop flow, removed 11 redundant places. [2021-12-06 22:39:45,221 INFO L242 Difference]: Finished difference. Result has 183 places, 163 transitions, 1110 flow [2021-12-06 22:39:45,221 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1110, PETRI_PLACES=183, PETRI_TRANSITIONS=163} [2021-12-06 22:39:45,221 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 42 predicate places. [2021-12-06 22:39:45,222 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 163 transitions, 1110 flow [2021-12-06 22:39:45,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.53846153846153) internal successors, (1411), 13 states have internal predecessors, (1411), 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-12-06 22:39:45,222 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:45,222 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:45,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 22:39:45,222 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1860643419, now seen corresponding path program 4 times [2021-12-06 22:39:45,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:45,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095377851] [2021-12-06 22:39:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:45,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:45,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:45,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095377851] [2021-12-06 22:39:45,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095377851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:45,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:45,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 22:39:45,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619772196] [2021-12-06 22:39:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:45,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 22:39:45,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:45,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 22:39:45,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-06 22:39:45,414 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2021-12-06 22:39:45,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 163 transitions, 1110 flow. Second operand has 12 states, 12 states have (on average 108.66666666666667) internal successors, (1304), 12 states have internal predecessors, (1304), 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-12-06 22:39:45,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:45,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2021-12-06 22:39:45,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:46,011 INFO L129 PetriNetUnfolder]: 548/1528 cut-off events. [2021-12-06 22:39:46,011 INFO L130 PetriNetUnfolder]: For 27242/28907 co-relation queries the response was YES. [2021-12-06 22:39:46,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9758 conditions, 1528 events. 548/1528 cut-off events. For 27242/28907 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11010 event pairs, 61 based on Foata normal form. 36/1496 useless extension candidates. Maximal degree in co-relation 9658. Up to 514 conditions per place. [2021-12-06 22:39:46,033 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 62 selfloop transitions, 19 changer transitions 20/193 dead transitions. [2021-12-06 22:39:46,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 193 transitions, 2006 flow [2021-12-06 22:39:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1448 transitions. [2021-12-06 22:39:46,035 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8312284730195177 [2021-12-06 22:39:46,035 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1448 transitions. [2021-12-06 22:39:46,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1448 transitions. [2021-12-06 22:39:46,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:46,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1448 transitions. [2021-12-06 22:39:46,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.38461538461539) internal successors, (1448), 13 states have internal predecessors, (1448), 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-12-06 22:39:46,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:46,039 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:46,039 INFO L186 Difference]: Start difference. First operand has 183 places, 163 transitions, 1110 flow. Second operand 13 states and 1448 transitions. [2021-12-06 22:39:46,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 193 transitions, 2006 flow [2021-12-06 22:39:46,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 193 transitions, 1793 flow, removed 92 selfloop flow, removed 12 redundant places. [2021-12-06 22:39:46,060 INFO L242 Difference]: Finished difference. Result has 184 places, 164 transitions, 1141 flow [2021-12-06 22:39:46,060 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1141, PETRI_PLACES=184, PETRI_TRANSITIONS=164} [2021-12-06 22:39:46,061 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 43 predicate places. [2021-12-06 22:39:46,061 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 164 transitions, 1141 flow [2021-12-06 22:39:46,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.66666666666667) internal successors, (1304), 12 states have internal predecessors, (1304), 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-12-06 22:39:46,061 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:46,061 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:46,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 22:39:46,061 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash -191167323, now seen corresponding path program 1 times [2021-12-06 22:39:46,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:46,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024940825] [2021-12-06 22:39:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:46,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:46,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024940825] [2021-12-06 22:39:46,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024940825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:46,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:46,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:39:46,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656900772] [2021-12-06 22:39:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:46,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:39:46,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:39:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:39:46,145 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:46,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 164 transitions, 1141 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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-12-06 22:39:46,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:46,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:46,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:48,227 INFO L129 PetriNetUnfolder]: 7701/13312 cut-off events. [2021-12-06 22:39:48,227 INFO L130 PetriNetUnfolder]: For 215022/217155 co-relation queries the response was YES. [2021-12-06 22:39:48,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68846 conditions, 13312 events. 7701/13312 cut-off events. For 215022/217155 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 105177 event pairs, 371 based on Foata normal form. 856/13687 useless extension candidates. Maximal degree in co-relation 68750. Up to 4862 conditions per place. [2021-12-06 22:39:48,373 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 261 selfloop transitions, 18 changer transitions 12/386 dead transitions. [2021-12-06 22:39:48,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 386 transitions, 4735 flow [2021-12-06 22:39:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:39:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 22:39:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1172 transitions. [2021-12-06 22:39:48,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8746268656716418 [2021-12-06 22:39:48,375 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1172 transitions. [2021-12-06 22:39:48,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1172 transitions. [2021-12-06 22:39:48,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:48,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1172 transitions. [2021-12-06 22:39:48,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.2) internal successors, (1172), 10 states have internal predecessors, (1172), 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-12-06 22:39:48,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 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-12-06 22:39:48,378 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 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-12-06 22:39:48,378 INFO L186 Difference]: Start difference. First operand has 184 places, 164 transitions, 1141 flow. Second operand 10 states and 1172 transitions. [2021-12-06 22:39:48,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 386 transitions, 4735 flow [2021-12-06 22:39:48,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 386 transitions, 4488 flow, removed 73 selfloop flow, removed 11 redundant places. [2021-12-06 22:39:48,474 INFO L242 Difference]: Finished difference. Result has 182 places, 180 transitions, 1201 flow [2021-12-06 22:39:48,474 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1201, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2021-12-06 22:39:48,474 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 41 predicate places. [2021-12-06 22:39:48,474 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 1201 flow [2021-12-06 22:39:48,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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-12-06 22:39:48,475 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:48,475 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:48,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 22:39:48,475 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1854635390, now seen corresponding path program 1 times [2021-12-06 22:39:48,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:48,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257707598] [2021-12-06 22:39:48,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:48,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:48,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:48,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257707598] [2021-12-06 22:39:48,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257707598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:48,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:48,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:39:48,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647159181] [2021-12-06 22:39:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:48,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:39:48,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:39:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:39:48,565 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:48,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 1201 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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-12-06 22:39:48,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:48,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:48,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:50,666 INFO L129 PetriNetUnfolder]: 7043/12723 cut-off events. [2021-12-06 22:39:50,666 INFO L130 PetriNetUnfolder]: For 182583/185256 co-relation queries the response was YES. [2021-12-06 22:39:50,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71423 conditions, 12723 events. 7043/12723 cut-off events. For 182583/185256 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 107339 event pairs, 153 based on Foata normal form. 1116/13613 useless extension candidates. Maximal degree in co-relation 71328. Up to 3325 conditions per place. [2021-12-06 22:39:50,799 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 293 selfloop transitions, 36 changer transitions 43/467 dead transitions. [2021-12-06 22:39:50,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 467 transitions, 5952 flow [2021-12-06 22:39:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 22:39:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 22:39:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2021-12-06 22:39:50,802 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8754305396096441 [2021-12-06 22:39:50,802 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1525 transitions. [2021-12-06 22:39:50,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1525 transitions. [2021-12-06 22:39:50,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:50,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1525 transitions. [2021-12-06 22:39:50,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.3076923076923) internal successors, (1525), 13 states have internal predecessors, (1525), 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-12-06 22:39:50,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:50,805 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 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-12-06 22:39:50,805 INFO L186 Difference]: Start difference. First operand has 182 places, 180 transitions, 1201 flow. Second operand 13 states and 1525 transitions. [2021-12-06 22:39:50,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 467 transitions, 5952 flow [2021-12-06 22:39:50,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 467 transitions, 5950 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:39:50,924 INFO L242 Difference]: Finished difference. Result has 199 places, 196 transitions, 1439 flow [2021-12-06 22:39:50,924 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1439, PETRI_PLACES=199, PETRI_TRANSITIONS=196} [2021-12-06 22:39:50,924 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 58 predicate places. [2021-12-06 22:39:50,924 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 196 transitions, 1439 flow [2021-12-06 22:39:50,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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-12-06 22:39:50,925 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:50,925 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:50,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 22:39:50,925 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 630994345, now seen corresponding path program 1 times [2021-12-06 22:39:50,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542527649] [2021-12-06 22:39:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:50,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:51,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:51,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542527649] [2021-12-06 22:39:51,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542527649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:51,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:51,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:39:51,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662582038] [2021-12-06 22:39:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:51,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:39:51,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:51,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:39:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:39:51,043 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2021-12-06 22:39:51,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 196 transitions, 1439 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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-12-06 22:39:51,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:51,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2021-12-06 22:39:51,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:52,549 INFO L129 PetriNetUnfolder]: 2486/8755 cut-off events. [2021-12-06 22:39:52,549 INFO L130 PetriNetUnfolder]: For 61990/69415 co-relation queries the response was YES. [2021-12-06 22:39:52,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37585 conditions, 8755 events. 2486/8755 cut-off events. For 61990/69415 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 108417 event pairs, 320 based on Foata normal form. 184/8327 useless extension candidates. Maximal degree in co-relation 37482. Up to 2462 conditions per place. [2021-12-06 22:39:52,653 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 139 selfloop transitions, 11 changer transitions 24/308 dead transitions. [2021-12-06 22:39:52,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 308 transitions, 3712 flow [2021-12-06 22:39:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:39:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:39:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1060 transitions. [2021-12-06 22:39:52,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.87893864013267 [2021-12-06 22:39:52,655 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1060 transitions. [2021-12-06 22:39:52,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1060 transitions. [2021-12-06 22:39:52,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:52,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1060 transitions. [2021-12-06 22:39:52,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.77777777777777) internal successors, (1060), 9 states have internal predecessors, (1060), 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-12-06 22:39:52,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-12-06 22:39:52,657 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-12-06 22:39:52,657 INFO L186 Difference]: Start difference. First operand has 199 places, 196 transitions, 1439 flow. Second operand 9 states and 1060 transitions. [2021-12-06 22:39:52,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 308 transitions, 3712 flow [2021-12-06 22:39:53,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 308 transitions, 3611 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-12-06 22:39:53,083 INFO L242 Difference]: Finished difference. Result has 210 places, 204 transitions, 1483 flow [2021-12-06 22:39:53,083 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1483, PETRI_PLACES=210, PETRI_TRANSITIONS=204} [2021-12-06 22:39:53,083 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 69 predicate places. [2021-12-06 22:39:53,084 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 204 transitions, 1483 flow [2021-12-06 22:39:53,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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-12-06 22:39:53,084 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:53,084 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:53,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 22:39:53,084 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash 616501348, now seen corresponding path program 1 times [2021-12-06 22:39:53,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:53,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728826777] [2021-12-06 22:39:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:53,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:53,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728826777] [2021-12-06 22:39:53,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728826777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:53,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:53,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:39:53,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252709069] [2021-12-06 22:39:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:53,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:39:53,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:39:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:39:53,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:53,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 204 transitions, 1483 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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-12-06 22:39:53,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:53,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:53,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:56,308 INFO L129 PetriNetUnfolder]: 9675/17724 cut-off events. [2021-12-06 22:39:56,308 INFO L130 PetriNetUnfolder]: For 271506/275549 co-relation queries the response was YES. [2021-12-06 22:39:56,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102861 conditions, 17724 events. 9675/17724 cut-off events. For 271506/275549 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 164373 event pairs, 97 based on Foata normal form. 1743/19153 useless extension candidates. Maximal degree in co-relation 102752. Up to 3129 conditions per place. [2021-12-06 22:39:56,477 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 138 selfloop transitions, 25 changer transitions 240/497 dead transitions. [2021-12-06 22:39:56,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 497 transitions, 6627 flow [2021-12-06 22:39:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 22:39:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 22:39:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2021-12-06 22:39:56,480 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8759328358208955 [2021-12-06 22:39:56,480 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2021-12-06 22:39:56,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2021-12-06 22:39:56,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:56,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2021-12-06 22:39:56,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 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-12-06 22:39:56,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 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-12-06 22:39:56,487 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 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-12-06 22:39:56,487 INFO L186 Difference]: Start difference. First operand has 210 places, 204 transitions, 1483 flow. Second operand 16 states and 1878 transitions. [2021-12-06 22:39:56,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 497 transitions, 6627 flow [2021-12-06 22:39:57,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 497 transitions, 6226 flow, removed 122 selfloop flow, removed 7 redundant places. [2021-12-06 22:39:57,155 INFO L242 Difference]: Finished difference. Result has 225 places, 171 transitions, 1208 flow [2021-12-06 22:39:57,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1208, PETRI_PLACES=225, PETRI_TRANSITIONS=171} [2021-12-06 22:39:57,156 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 84 predicate places. [2021-12-06 22:39:57,156 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 171 transitions, 1208 flow [2021-12-06 22:39:57,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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-12-06 22:39:57,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:57,157 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:57,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 22:39:57,157 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1230508466, now seen corresponding path program 1 times [2021-12-06 22:39:57,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:57,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905422073] [2021-12-06 22:39:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:57,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:57,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:57,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905422073] [2021-12-06 22:39:57,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905422073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:57,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:57,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:39:57,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124034559] [2021-12-06 22:39:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:57,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:39:57,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:39:57,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:39:57,255 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2021-12-06 22:39:57,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 171 transitions, 1208 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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-12-06 22:39:57,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:57,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2021-12-06 22:39:57,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:39:59,205 INFO L129 PetriNetUnfolder]: 4731/9708 cut-off events. [2021-12-06 22:39:59,205 INFO L130 PetriNetUnfolder]: For 143296/145397 co-relation queries the response was YES. [2021-12-06 22:39:59,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58437 conditions, 9708 events. 4731/9708 cut-off events. For 143296/145397 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 94184 event pairs, 184 based on Foata normal form. 726/10235 useless extension candidates. Maximal degree in co-relation 58379. Up to 1929 conditions per place. [2021-12-06 22:39:59,287 INFO L132 encePairwiseOnDemand]: 124/134 looper letters, 107 selfloop transitions, 25 changer transitions 144/370 dead transitions. [2021-12-06 22:39:59,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 370 transitions, 4556 flow [2021-12-06 22:39:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 22:39:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 22:39:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1835 transitions. [2021-12-06 22:39:59,289 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8558768656716418 [2021-12-06 22:39:59,289 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1835 transitions. [2021-12-06 22:39:59,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1835 transitions. [2021-12-06 22:39:59,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:39:59,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1835 transitions. [2021-12-06 22:39:59,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.6875) internal successors, (1835), 16 states have internal predecessors, (1835), 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-12-06 22:39:59,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 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-12-06 22:39:59,294 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 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-12-06 22:39:59,294 INFO L186 Difference]: Start difference. First operand has 225 places, 171 transitions, 1208 flow. Second operand 16 states and 1835 transitions. [2021-12-06 22:39:59,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 370 transitions, 4556 flow [2021-12-06 22:39:59,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 370 transitions, 3825 flow, removed 302 selfloop flow, removed 23 redundant places. [2021-12-06 22:39:59,880 INFO L242 Difference]: Finished difference. Result has 208 places, 160 transitions, 928 flow [2021-12-06 22:39:59,880 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=928, PETRI_PLACES=208, PETRI_TRANSITIONS=160} [2021-12-06 22:39:59,880 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 67 predicate places. [2021-12-06 22:39:59,880 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 160 transitions, 928 flow [2021-12-06 22:39:59,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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-12-06 22:39:59,881 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:39:59,881 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:39:59,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 22:39:59,881 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:39:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:39:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2059017694, now seen corresponding path program 1 times [2021-12-06 22:39:59,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:39:59,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256322558] [2021-12-06 22:39:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:39:59,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:39:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:39:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:39:59,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:39:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256322558] [2021-12-06 22:39:59,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256322558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:39:59,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:39:59,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:39:59,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105895650] [2021-12-06 22:39:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:39:59,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:39:59,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:39:59,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:39:59,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:39:59,957 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-06 22:39:59,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 160 transitions, 928 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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-12-06 22:39:59,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:39:59,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-06 22:39:59,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:40:00,705 INFO L129 PetriNetUnfolder]: 1011/5028 cut-off events. [2021-12-06 22:40:00,705 INFO L130 PetriNetUnfolder]: For 18613/20520 co-relation queries the response was YES. [2021-12-06 22:40:00,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16688 conditions, 5028 events. 1011/5028 cut-off events. For 18613/20520 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 64946 event pairs, 37 based on Foata normal form. 34/4616 useless extension candidates. Maximal degree in co-relation 16584. Up to 870 conditions per place. [2021-12-06 22:40:00,749 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 71 selfloop transitions, 2 changer transitions 5/197 dead transitions. [2021-12-06 22:40:00,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 197 transitions, 1445 flow [2021-12-06 22:40:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:40:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:40:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2021-12-06 22:40:00,750 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8550106609808102 [2021-12-06 22:40:00,750 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2021-12-06 22:40:00,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2021-12-06 22:40:00,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:40:00,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2021-12-06 22:40:00,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 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-12-06 22:40:00,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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-12-06 22:40:00,752 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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-12-06 22:40:00,752 INFO L186 Difference]: Start difference. First operand has 208 places, 160 transitions, 928 flow. Second operand 7 states and 802 transitions. [2021-12-06 22:40:00,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 197 transitions, 1445 flow [2021-12-06 22:40:00,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 197 transitions, 1147 flow, removed 95 selfloop flow, removed 28 redundant places. [2021-12-06 22:40:00,931 INFO L242 Difference]: Finished difference. Result has 187 places, 161 transitions, 730 flow [2021-12-06 22:40:00,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=730, PETRI_PLACES=187, PETRI_TRANSITIONS=161} [2021-12-06 22:40:00,932 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 46 predicate places. [2021-12-06 22:40:00,932 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 161 transitions, 730 flow [2021-12-06 22:40:00,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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-12-06 22:40:00,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:40:00,932 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:40:00,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 22:40:00,932 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:40:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:40:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1923619374, now seen corresponding path program 2 times [2021-12-06 22:40:00,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:40:00,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848592141] [2021-12-06 22:40:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:40:00,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:40:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:40:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:40:01,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:40:01,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848592141] [2021-12-06 22:40:01,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848592141] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:40:01,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:40:01,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:40:01,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735201298] [2021-12-06 22:40:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:40:01,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:40:01,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:40:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:40:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:40:01,024 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2021-12-06 22:40:01,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 161 transitions, 730 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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-12-06 22:40:01,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:40:01,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2021-12-06 22:40:01,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:40:02,266 INFO L129 PetriNetUnfolder]: 2168/11666 cut-off events. [2021-12-06 22:40:02,266 INFO L130 PetriNetUnfolder]: For 14616/15824 co-relation queries the response was YES. [2021-12-06 22:40:02,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28774 conditions, 11666 events. 2168/11666 cut-off events. For 14616/15824 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 179864 event pairs, 51 based on Foata normal form. 76/10784 useless extension candidates. Maximal degree in co-relation 28742. Up to 1938 conditions per place. [2021-12-06 22:40:02,363 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 27 selfloop transitions, 1 changer transitions 76/222 dead transitions. [2021-12-06 22:40:02,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 222 transitions, 1422 flow [2021-12-06 22:40:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:40:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:40:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2021-12-06 22:40:02,364 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8603411513859275 [2021-12-06 22:40:02,364 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2021-12-06 22:40:02,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2021-12-06 22:40:02,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:40:02,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2021-12-06 22:40:02,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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-12-06 22:40:02,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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-12-06 22:40:02,367 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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-12-06 22:40:02,367 INFO L186 Difference]: Start difference. First operand has 187 places, 161 transitions, 730 flow. Second operand 7 states and 807 transitions. [2021-12-06 22:40:02,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 222 transitions, 1422 flow [2021-12-06 22:40:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 222 transitions, 1385 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-12-06 22:40:02,761 INFO L242 Difference]: Finished difference. Result has 190 places, 144 transitions, 585 flow [2021-12-06 22:40:02,761 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=585, PETRI_PLACES=190, PETRI_TRANSITIONS=144} [2021-12-06 22:40:02,761 INFO L334 CegarLoopForPetriNet]: 141 programPoint places, 49 predicate places. [2021-12-06 22:40:02,762 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 144 transitions, 585 flow [2021-12-06 22:40:02,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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-12-06 22:40:02,762 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:40:02,762 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:40:02,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 22:40:02,762 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-06 22:40:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:40:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash -670198604, now seen corresponding path program 3 times [2021-12-06 22:40:02,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:40:02,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282674794] [2021-12-06 22:40:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:40:02,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:40:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:40:02,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:40:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:40:02,861 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:40:02,861 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 22:40:02,861 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-06 22:40:02,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-06 22:40:02,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-06 22:40:02,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-06 22:40:02,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-06 22:40:02,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-06 22:40:02,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-06 22:40:02,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 22:40:02,866 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:40:02,870 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 22:40:02,870 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 22:40:03,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 10:40:03 BasicIcfg [2021-12-06 22:40:03,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 22:40:03,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:40:03,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:40:03,021 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:40:03,021 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:39:36" (3/4) ... [2021-12-06 22:40:03,022 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 22:40:03,109 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:40:03,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:40:03,109 INFO L158 Benchmark]: Toolchain (without parser) took 27988.06ms. Allocated memory was 119.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 81.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 672.0MB. Max. memory is 16.1GB. [2021-12-06 22:40:03,110 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory was 99.3MB in the beginning and 99.2MB in the end (delta: 89.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:40:03,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.98ms. Allocated memory is still 119.5MB. Free memory was 81.1MB in the beginning and 82.0MB in the end (delta: -866.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 22:40:03,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 119.5MB. Free memory was 81.4MB in the beginning and 78.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:40:03,110 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 76.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:40:03,111 INFO L158 Benchmark]: RCFGBuilder took 712.48ms. Allocated memory is still 119.5MB. Free memory was 76.2MB in the beginning and 52.2MB in the end (delta: 24.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2021-12-06 22:40:03,111 INFO L158 Benchmark]: TraceAbstraction took 26713.93ms. Allocated memory was 119.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 51.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-06 22:40:03,111 INFO L158 Benchmark]: Witness Printer took 88.41ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-06 22:40:03,113 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.15ms. Allocated memory is still 119.5MB. Free memory was 99.3MB in the beginning and 99.2MB in the end (delta: 89.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.98ms. Allocated memory is still 119.5MB. Free memory was 81.1MB in the beginning and 82.0MB in the end (delta: -866.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 119.5MB. Free memory was 81.4MB in the beginning and 78.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 76.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 712.48ms. Allocated memory is still 119.5MB. Free memory was 76.2MB in the beginning and 52.2MB in the end (delta: 24.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26713.93ms. Allocated memory was 119.5MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 51.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 88.41ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t1433; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 848]: 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: 844]: 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: 842]: 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: 846]: 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 9 procedures, 169 locations, 7 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: 26.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1126 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 922 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1750 mSDsCounter, 442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3240 IncrementalHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 442 mSolverCounterUnsat, 168 mSDtfsCounter, 3240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1483occurred in iteration=16, InterpolantAutomatonStates: 233, 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.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1896 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1773 ConstructedInterpolants, 0 QuantifiedInterpolants, 9392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-12-06 22:40:03,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c643e3e3-868a-434e-a7dc-4c100348582a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE