./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD --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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 22:54:21,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:54:21,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:54:21,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:54:21,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:54:21,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:54:21,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:54:21,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:54:21,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:54:21,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:54:21,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:54:21,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:54:21,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:54:21,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:54:21,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:54:21,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:54:21,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:54:21,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:54:21,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:54:21,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:54:21,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:54:21,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:54:21,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:54:21,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:54:21,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:54:21,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:54:21,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:54:21,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:54:21,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:54:21,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:54:21,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:54:21,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:54:21,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:54:21,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:54:21,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:54:21,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:54:21,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:54:21,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:54:21,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:54:21,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:54:21,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:54:21,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 22:54:21,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:54:21,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:54:21,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:54:21,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:54:21,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:54:21,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:54:21,735 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:54:21,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:54:21,736 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:54:21,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:54:21,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:54:21,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:54:21,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:54:21,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:54:21,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:54:21,739 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:54:21,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:54:21,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:54:21,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:54:21,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:54:21,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:54:21,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:54:21,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:54:21,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:54:21,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:54:21,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:54:21,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:54:21,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:54:21,743 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:54:21,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:54:21,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:54:21,745 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:54:21,746 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_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/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_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2021-10-28 22:54:22,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:54:22,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:54:22,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:54:22,101 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:54:22,102 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:54:22,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-10-28 22:54:22,176 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/data/1a645f422/807291a6ffd14d8da91cb56c3d119ad2/FLAG02e79281b [2021-10-28 22:54:22,893 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:54:22,893 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-10-28 22:54:22,914 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/data/1a645f422/807291a6ffd14d8da91cb56c3d119ad2/FLAG02e79281b [2021-10-28 22:54:23,121 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/data/1a645f422/807291a6ffd14d8da91cb56c3d119ad2 [2021-10-28 22:54:23,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:54:23,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:54:23,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:54:23,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:54:23,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:54:23,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:23,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5f9842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23, skipping insertion in model container [2021-10-28 22:54:23,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:23,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:54:23,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:54:23,408 WARN L228 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_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-10-28 22:54:23,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:54:23,791 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:54:23,805 WARN L228 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_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-10-28 22:54:23,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:54:23,924 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:54:23,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23 WrapperNode [2021-10-28 22:54:23,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:54:23,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:54:23,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:54:23,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:54:23,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:23,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:54:24,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:54:24,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:54:24,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:54:24,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:54:24,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:54:24,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:54:24,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:54:24,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (1/1) ... [2021-10-28 22:54:24,145 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:54:24,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:54:24,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:54:24,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:54:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 22:54:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 22:54:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:54:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 22:54:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 22:54:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 22:54:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 22:54:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 22:54:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 22:54:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 22:54:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:54:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 22:54:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:54:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:54:24,253 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 22:54:26,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:54:26,520 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 22:54:26,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:54:26 BoogieIcfgContainer [2021-10-28 22:54:26,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:54:26,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:54:26,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:54:26,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:54:26,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:54:23" (1/3) ... [2021-10-28 22:54:26,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336411c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:54:26, skipping insertion in model container [2021-10-28 22:54:26,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:54:23" (2/3) ... [2021-10-28 22:54:26,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336411c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:54:26, skipping insertion in model container [2021-10-28 22:54:26,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:54:26" (3/3) ... [2021-10-28 22:54:26,537 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-10-28 22:54:26,550 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 22:54:26,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:54:26,551 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 22:54:26,551 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 22:54:26,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,617 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,634 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,638 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,665 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,671 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,672 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 22:54:26,675 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 22:54:26,731 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:54:26,738 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-10-28 22:54:26,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-28 22:54:26,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-10-28 22:54:26,807 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-10-28 22:54:26,807 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 22:54:26,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-28 22:54:26,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-10-28 22:54:26,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-10-28 22:54:26,830 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-10-28 22:54:26,831 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 22:54:26,831 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:26,832 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:26,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1847846630, now seen corresponding path program 1 times [2021-10-28 22:54:26,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:26,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525385417] [2021-10-28 22:54:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:26,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:27,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:27,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525385417] [2021-10-28 22:54:27,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525385417] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:27,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:27,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:54:27,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288985515] [2021-10-28 22:54:27,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:54:27,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:54:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:54:27,179 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 105 [2021-10-28 22:54:27,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-10-28 22:54:27,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:27,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 105 [2021-10-28 22:54:27,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:27,349 INFO L129 PetriNetUnfolder]: 49/392 cut-off events. [2021-10-28 22:54:27,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 22:54:27,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 392 events. 49/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1982 event pairs, 38 based on Foata normal form. 18/386 useless extension candidates. Maximal degree in co-relation 442. Up to 65 conditions per place. [2021-10-28 22:54:27,358 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 9 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2021-10-28 22:54:27,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 235 flow [2021-10-28 22:54:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:54:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 22:54:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2021-10-28 22:54:27,393 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.946031746031746 [2021-10-28 22:54:27,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2021-10-28 22:54:27,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2021-10-28 22:54:27,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:27,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2021-10-28 22:54:27,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-10-28 22:54:27,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-10-28 22:54:27,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-10-28 22:54:27,416 INFO L186 Difference]: Start difference. First operand has 110 places, 102 transitions, 213 flow. Second operand 3 states and 298 transitions. [2021-10-28 22:54:27,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 235 flow [2021-10-28 22:54:27,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-28 22:54:27,426 INFO L242 Difference]: Finished difference. Result has 107 places, 98 transitions, 206 flow [2021-10-28 22:54:27,428 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2021-10-28 22:54:27,429 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, -3 predicate places. [2021-10-28 22:54:27,430 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 206 flow [2021-10-28 22:54:27,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-10-28 22:54:27,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:27,431 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] [2021-10-28 22:54:27,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:54:27,432 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:27,433 INFO L85 PathProgramCache]: Analyzing trace with hash -459637492, now seen corresponding path program 1 times [2021-10-28 22:54:27,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:27,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158445239] [2021-10-28 22:54:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:27,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:27,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:27,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158445239] [2021-10-28 22:54:27,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158445239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:27,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:27,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:27,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603334272] [2021-10-28 22:54:27,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:27,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:27,814 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-28 22:54:27,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-10-28 22:54:27,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:27,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-28 22:54:27,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:28,045 INFO L129 PetriNetUnfolder]: 30/251 cut-off events. [2021-10-28 22:54:28,046 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 22:54:28,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 251 events. 30/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 938 event pairs, 6 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 295. Up to 36 conditions per place. [2021-10-28 22:54:28,052 INFO L132 encePairwiseOnDemand]: 98/105 looper letters, 8 selfloop transitions, 3 changer transitions 31/121 dead transitions. [2021-10-28 22:54:28,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 318 flow [2021-10-28 22:54:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:54:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 22:54:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2021-10-28 22:54:28,064 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9132275132275133 [2021-10-28 22:54:28,064 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2021-10-28 22:54:28,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2021-10-28 22:54:28,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:28,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2021-10-28 22:54:28,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 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-10-28 22:54:28,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:28,078 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:28,078 INFO L186 Difference]: Start difference. First operand has 107 places, 98 transitions, 206 flow. Second operand 9 states and 863 transitions. [2021-10-28 22:54:28,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 318 flow [2021-10-28 22:54:28,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 121 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 22:54:28,092 INFO L242 Difference]: Finished difference. Result has 120 places, 90 transitions, 225 flow [2021-10-28 22:54:28,093 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=120, PETRI_TRANSITIONS=90} [2021-10-28 22:54:28,093 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2021-10-28 22:54:28,094 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 90 transitions, 225 flow [2021-10-28 22:54:28,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-10-28 22:54:28,095 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:28,095 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] [2021-10-28 22:54:28,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:54:28,095 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash 633044429, now seen corresponding path program 1 times [2021-10-28 22:54:28,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:28,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505765731] [2021-10-28 22:54:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:28,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:28,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:28,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505765731] [2021-10-28 22:54:28,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505765731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:28,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:28,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:28,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471801621] [2021-10-28 22:54:28,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:28,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:28,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:28,528 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-28 22:54:28,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 90 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-10-28 22:54:28,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:28,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-28 22:54:28,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:28,770 INFO L129 PetriNetUnfolder]: 58/257 cut-off events. [2021-10-28 22:54:28,770 INFO L130 PetriNetUnfolder]: For 213/225 co-relation queries the response was YES. [2021-10-28 22:54:28,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 257 events. 58/257 cut-off events. For 213/225 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 972 event pairs, 17 based on Foata normal form. 6/252 useless extension candidates. Maximal degree in co-relation 501. Up to 60 conditions per place. [2021-10-28 22:54:28,775 INFO L132 encePairwiseOnDemand]: 98/105 looper letters, 8 selfloop transitions, 3 changer transitions 19/111 dead transitions. [2021-10-28 22:54:28,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 345 flow [2021-10-28 22:54:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:54:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 22:54:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 860 transitions. [2021-10-28 22:54:28,781 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.91005291005291 [2021-10-28 22:54:28,782 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 860 transitions. [2021-10-28 22:54:28,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 860 transitions. [2021-10-28 22:54:28,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:28,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 860 transitions. [2021-10-28 22:54:28,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.55555555555556) internal successors, (860), 9 states have internal predecessors, (860), 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-10-28 22:54:28,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:28,793 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:28,793 INFO L186 Difference]: Start difference. First operand has 120 places, 90 transitions, 225 flow. Second operand 9 states and 860 transitions. [2021-10-28 22:54:28,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 345 flow [2021-10-28 22:54:28,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 328 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-10-28 22:54:28,809 INFO L242 Difference]: Finished difference. Result has 115 places, 92 transitions, 259 flow [2021-10-28 22:54:28,810 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=115, PETRI_TRANSITIONS=92} [2021-10-28 22:54:28,810 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2021-10-28 22:54:28,810 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 259 flow [2021-10-28 22:54:28,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-10-28 22:54:28,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:28,812 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] [2021-10-28 22:54:28,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:54:28,812 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash -672384026, now seen corresponding path program 1 times [2021-10-28 22:54:28,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:28,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289385094] [2021-10-28 22:54:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:28,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:29,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:29,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289385094] [2021-10-28 22:54:29,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289385094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:29,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:29,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:29,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011546945] [2021-10-28 22:54:29,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:29,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:29,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:29,043 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-28 22:54:29,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-10-28 22:54:29,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:29,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-28 22:54:29,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:29,265 INFO L129 PetriNetUnfolder]: 34/278 cut-off events. [2021-10-28 22:54:29,265 INFO L130 PetriNetUnfolder]: For 439/506 co-relation queries the response was YES. [2021-10-28 22:54:29,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 278 events. 34/278 cut-off events. For 439/506 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1262 event pairs, 4 based on Foata normal form. 8/276 useless extension candidates. Maximal degree in co-relation 620. Up to 36 conditions per place. [2021-10-28 22:54:29,269 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 12 selfloop transitions, 3 changer transitions 10/106 dead transitions. [2021-10-28 22:54:29,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 106 transitions, 407 flow [2021-10-28 22:54:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:54:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 22:54:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-10-28 22:54:29,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9037037037037037 [2021-10-28 22:54:29,274 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-10-28 22:54:29,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-10-28 22:54:29,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:29,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-10-28 22:54:29,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 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-10-28 22:54:29,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:29,282 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:29,283 INFO L186 Difference]: Start difference. First operand has 115 places, 92 transitions, 259 flow. Second operand 9 states and 854 transitions. [2021-10-28 22:54:29,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 106 transitions, 407 flow [2021-10-28 22:54:29,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 106 transitions, 376 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-10-28 22:54:29,291 INFO L242 Difference]: Finished difference. Result has 120 places, 92 transitions, 271 flow [2021-10-28 22:54:29,291 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=120, PETRI_TRANSITIONS=92} [2021-10-28 22:54:29,291 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2021-10-28 22:54:29,292 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 92 transitions, 271 flow [2021-10-28 22:54:29,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-10-28 22:54:29,292 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:29,293 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] [2021-10-28 22:54:29,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:54:29,293 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 44194158, now seen corresponding path program 1 times [2021-10-28 22:54:29,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:29,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706861534] [2021-10-28 22:54:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:29,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:29,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:29,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706861534] [2021-10-28 22:54:29,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706861534] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:29,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:29,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 22:54:29,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390276342] [2021-10-28 22:54:29,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 22:54:29,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 22:54:29,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:54:29,600 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2021-10-28 22:54:29,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 92 transitions, 271 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 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-10-28 22:54:29,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:29,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2021-10-28 22:54:29,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:30,454 INFO L129 PetriNetUnfolder]: 925/1986 cut-off events. [2021-10-28 22:54:30,454 INFO L130 PetriNetUnfolder]: For 4512/4572 co-relation queries the response was YES. [2021-10-28 22:54:30,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 1986 events. 925/1986 cut-off events. For 4512/4572 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 13699 event pairs, 333 based on Foata normal form. 66/1978 useless extension candidates. Maximal degree in co-relation 5396. Up to 789 conditions per place. [2021-10-28 22:54:30,520 INFO L132 encePairwiseOnDemand]: 93/105 looper letters, 14 selfloop transitions, 10 changer transitions 44/144 dead transitions. [2021-10-28 22:54:30,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 571 flow [2021-10-28 22:54:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 22:54:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 22:54:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1331 transitions. [2021-10-28 22:54:30,526 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8450793650793651 [2021-10-28 22:54:30,526 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1331 transitions. [2021-10-28 22:54:30,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1331 transitions. [2021-10-28 22:54:30,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:30,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1331 transitions. [2021-10-28 22:54:30,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.73333333333333) internal successors, (1331), 15 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:30,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 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-10-28 22:54:30,538 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 105.0) internal successors, (1680), 16 states have internal predecessors, (1680), 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-10-28 22:54:30,538 INFO L186 Difference]: Start difference. First operand has 120 places, 92 transitions, 271 flow. Second operand 15 states and 1331 transitions. [2021-10-28 22:54:30,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 571 flow [2021-10-28 22:54:30,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 144 transitions, 526 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-10-28 22:54:30,564 INFO L242 Difference]: Finished difference. Result has 132 places, 98 transitions, 334 flow [2021-10-28 22:54:30,564 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=334, PETRI_PLACES=132, PETRI_TRANSITIONS=98} [2021-10-28 22:54:30,564 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 22 predicate places. [2021-10-28 22:54:30,565 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 334 flow [2021-10-28 22:54:30,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 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-10-28 22:54:30,566 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:30,566 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] [2021-10-28 22:54:30,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:54:30,566 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2113384258, now seen corresponding path program 1 times [2021-10-28 22:54:30,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:30,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324716694] [2021-10-28 22:54:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:30,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:30,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:30,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324716694] [2021-10-28 22:54:30,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324716694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:30,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:30,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 22:54:30,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080606582] [2021-10-28 22:54:30,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 22:54:30,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 22:54:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:54:30,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 105 [2021-10-28 22:54:30,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 98 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 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-10-28 22:54:30,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:30,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 105 [2021-10-28 22:54:30,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:31,621 INFO L129 PetriNetUnfolder]: 715/1664 cut-off events. [2021-10-28 22:54:31,622 INFO L130 PetriNetUnfolder]: For 6512/6592 co-relation queries the response was YES. [2021-10-28 22:54:31,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 1664 events. 715/1664 cut-off events. For 6512/6592 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11244 event pairs, 270 based on Foata normal form. 52/1663 useless extension candidates. Maximal degree in co-relation 5847. Up to 645 conditions per place. [2021-10-28 22:54:31,655 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 29 selfloop transitions, 9 changer transitions 37/152 dead transitions. [2021-10-28 22:54:31,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 836 flow [2021-10-28 22:54:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 22:54:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 22:54:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1262 transitions. [2021-10-28 22:54:31,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8585034013605443 [2021-10-28 22:54:31,662 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1262 transitions. [2021-10-28 22:54:31,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1262 transitions. [2021-10-28 22:54:31,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:31,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1262 transitions. [2021-10-28 22:54:31,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.14285714285714) internal successors, (1262), 14 states have internal predecessors, (1262), 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-10-28 22:54:31,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 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-10-28 22:54:31,675 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 105.0) internal successors, (1575), 15 states have internal predecessors, (1575), 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-10-28 22:54:31,675 INFO L186 Difference]: Start difference. First operand has 132 places, 98 transitions, 334 flow. Second operand 14 states and 1262 transitions. [2021-10-28 22:54:31,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 836 flow [2021-10-28 22:54:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 152 transitions, 802 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-10-28 22:54:31,698 INFO L242 Difference]: Finished difference. Result has 142 places, 102 transitions, 412 flow [2021-10-28 22:54:31,699 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=412, PETRI_PLACES=142, PETRI_TRANSITIONS=102} [2021-10-28 22:54:31,699 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 32 predicate places. [2021-10-28 22:54:31,699 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 102 transitions, 412 flow [2021-10-28 22:54:31,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 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-10-28 22:54:31,700 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:31,701 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] [2021-10-28 22:54:31,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 22:54:31,701 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -955308008, now seen corresponding path program 1 times [2021-10-28 22:54:31,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:31,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941824060] [2021-10-28 22:54:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:31,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:31,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:31,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941824060] [2021-10-28 22:54:31,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941824060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:31,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:31,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:31,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482958654] [2021-10-28 22:54:31,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:31,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:31,923 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 105 [2021-10-28 22:54:31,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 102 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-10-28 22:54:31,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:31,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 105 [2021-10-28 22:54:31,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:32,609 INFO L129 PetriNetUnfolder]: 538/1637 cut-off events. [2021-10-28 22:54:32,609 INFO L130 PetriNetUnfolder]: For 13631/14255 co-relation queries the response was YES. [2021-10-28 22:54:32,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7356 conditions, 1637 events. 538/1637 cut-off events. For 13631/14255 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13450 event pairs, 257 based on Foata normal form. 52/1579 useless extension candidates. Maximal degree in co-relation 7275. Up to 438 conditions per place. [2021-10-28 22:54:32,649 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 12 selfloop transitions, 3 changer transitions 10/116 dead transitions. [2021-10-28 22:54:32,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 116 transitions, 624 flow [2021-10-28 22:54:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:54:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 22:54:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-10-28 22:54:32,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9037037037037037 [2021-10-28 22:54:32,655 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-10-28 22:54:32,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-10-28 22:54:32,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:32,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-10-28 22:54:32,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 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-10-28 22:54:32,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:32,664 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-10-28 22:54:32,665 INFO L186 Difference]: Start difference. First operand has 142 places, 102 transitions, 412 flow. Second operand 9 states and 854 transitions. [2021-10-28 22:54:32,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 116 transitions, 624 flow [2021-10-28 22:54:32,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 116 transitions, 566 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-10-28 22:54:32,713 INFO L242 Difference]: Finished difference. Result has 140 places, 102 transitions, 411 flow [2021-10-28 22:54:32,714 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=411, PETRI_PLACES=140, PETRI_TRANSITIONS=102} [2021-10-28 22:54:32,714 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 30 predicate places. [2021-10-28 22:54:32,714 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 102 transitions, 411 flow [2021-10-28 22:54:32,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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-10-28 22:54:32,715 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:32,716 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] [2021-10-28 22:54:32,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:54:32,716 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1576691181, now seen corresponding path program 1 times [2021-10-28 22:54:32,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:32,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799763165] [2021-10-28 22:54:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:32,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:33,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:33,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799763165] [2021-10-28 22:54:33,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799763165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:33,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:33,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 22:54:33,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084496834] [2021-10-28 22:54:33,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 22:54:33,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 22:54:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 22:54:33,157 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-10-28 22:54:33,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 102 transitions, 411 flow. Second operand has 12 states, 12 states have (on average 84.08333333333333) internal successors, (1009), 12 states have internal predecessors, (1009), 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-10-28 22:54:33,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:33,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-10-28 22:54:33,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:34,163 INFO L129 PetriNetUnfolder]: 677/1597 cut-off events. [2021-10-28 22:54:34,164 INFO L130 PetriNetUnfolder]: For 11938/12224 co-relation queries the response was YES. [2021-10-28 22:54:34,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7654 conditions, 1597 events. 677/1597 cut-off events. For 11938/12224 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10715 event pairs, 348 based on Foata normal form. 52/1579 useless extension candidates. Maximal degree in co-relation 7569. Up to 959 conditions per place. [2021-10-28 22:54:34,207 INFO L132 encePairwiseOnDemand]: 91/105 looper letters, 20 selfloop transitions, 15 changer transitions 41/151 dead transitions. [2021-10-28 22:54:34,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 151 transitions, 1014 flow [2021-10-28 22:54:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 22:54:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 22:54:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1391 transitions. [2021-10-28 22:54:34,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8279761904761904 [2021-10-28 22:54:34,214 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1391 transitions. [2021-10-28 22:54:34,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1391 transitions. [2021-10-28 22:54:34,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:34,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1391 transitions. [2021-10-28 22:54:34,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.9375) internal successors, (1391), 16 states have internal predecessors, (1391), 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-10-28 22:54:34,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 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-10-28 22:54:34,231 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 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-10-28 22:54:34,231 INFO L186 Difference]: Start difference. First operand has 140 places, 102 transitions, 411 flow. Second operand 16 states and 1391 transitions. [2021-10-28 22:54:34,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 151 transitions, 1014 flow [2021-10-28 22:54:34,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 151 transitions, 961 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-10-28 22:54:34,267 INFO L242 Difference]: Finished difference. Result has 153 places, 109 transitions, 538 flow [2021-10-28 22:54:34,268 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=538, PETRI_PLACES=153, PETRI_TRANSITIONS=109} [2021-10-28 22:54:34,268 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 43 predicate places. [2021-10-28 22:54:34,268 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 109 transitions, 538 flow [2021-10-28 22:54:34,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.08333333333333) internal successors, (1009), 12 states have internal predecessors, (1009), 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-10-28 22:54:34,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:34,270 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] [2021-10-28 22:54:34,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:54:34,270 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1745901103, now seen corresponding path program 1 times [2021-10-28 22:54:34,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:34,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115236828] [2021-10-28 22:54:34,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:34,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:34,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:34,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115236828] [2021-10-28 22:54:34,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115236828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:34,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:34,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 22:54:34,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383235104] [2021-10-28 22:54:34,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 22:54:34,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 22:54:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-28 22:54:34,736 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 105 [2021-10-28 22:54:34,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 109 transitions, 538 flow. Second operand has 12 states, 12 states have (on average 85.16666666666667) internal successors, (1022), 12 states have internal predecessors, (1022), 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-10-28 22:54:34,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:34,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 105 [2021-10-28 22:54:34,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:36,043 INFO L129 PetriNetUnfolder]: 787/2385 cut-off events. [2021-10-28 22:54:36,044 INFO L130 PetriNetUnfolder]: For 24424/25072 co-relation queries the response was YES. [2021-10-28 22:54:36,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11723 conditions, 2385 events. 787/2385 cut-off events. For 24424/25072 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21174 event pairs, 135 based on Foata normal form. 95/2403 useless extension candidates. Maximal degree in co-relation 11627. Up to 599 conditions per place. [2021-10-28 22:54:36,096 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 30 selfloop transitions, 11 changer transitions 33/149 dead transitions. [2021-10-28 22:54:36,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 149 transitions, 1262 flow [2021-10-28 22:54:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 22:54:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 22:54:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1151 transitions. [2021-10-28 22:54:36,102 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8432234432234432 [2021-10-28 22:54:36,102 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1151 transitions. [2021-10-28 22:54:36,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1151 transitions. [2021-10-28 22:54:36,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:36,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1151 transitions. [2021-10-28 22:54:36,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 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-10-28 22:54:36,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 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-10-28 22:54:36,114 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 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-10-28 22:54:36,114 INFO L186 Difference]: Start difference. First operand has 153 places, 109 transitions, 538 flow. Second operand 13 states and 1151 transitions. [2021-10-28 22:54:36,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 149 transitions, 1262 flow [2021-10-28 22:54:36,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 1075 flow, removed 86 selfloop flow, removed 13 redundant places. [2021-10-28 22:54:36,219 INFO L242 Difference]: Finished difference. Result has 150 places, 109 transitions, 544 flow [2021-10-28 22:54:36,219 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=544, PETRI_PLACES=150, PETRI_TRANSITIONS=109} [2021-10-28 22:54:36,220 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 40 predicate places. [2021-10-28 22:54:36,220 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 109 transitions, 544 flow [2021-10-28 22:54:36,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.16666666666667) internal successors, (1022), 12 states have internal predecessors, (1022), 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-10-28 22:54:36,221 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:36,221 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:36,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:54:36,222 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash -151558173, now seen corresponding path program 1 times [2021-10-28 22:54:36,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:36,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502438551] [2021-10-28 22:54:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:36,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:36,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:36,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502438551] [2021-10-28 22:54:36,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502438551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:36,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:36,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 22:54:36,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672077733] [2021-10-28 22:54:36,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 22:54:36,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 22:54:36,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-28 22:54:36,694 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-10-28 22:54:36,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 109 transitions, 544 flow. Second operand has 11 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 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-10-28 22:54:36,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:36,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-10-28 22:54:36,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:37,644 INFO L129 PetriNetUnfolder]: 475/1476 cut-off events. [2021-10-28 22:54:37,644 INFO L130 PetriNetUnfolder]: For 14314/14968 co-relation queries the response was YES. [2021-10-28 22:54:37,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 1476 events. 475/1476 cut-off events. For 14314/14968 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11609 event pairs, 121 based on Foata normal form. 68/1489 useless extension candidates. Maximal degree in co-relation 7419. Up to 614 conditions per place. [2021-10-28 22:54:37,680 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 28 selfloop transitions, 17 changer transitions 32/152 dead transitions. [2021-10-28 22:54:37,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 152 transitions, 1247 flow [2021-10-28 22:54:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 22:54:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-28 22:54:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1562 transitions. [2021-10-28 22:54:37,762 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8264550264550264 [2021-10-28 22:54:37,762 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1562 transitions. [2021-10-28 22:54:37,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1562 transitions. [2021-10-28 22:54:37,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:37,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1562 transitions. [2021-10-28 22:54:37,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.77777777777777) internal successors, (1562), 18 states have internal predecessors, (1562), 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-10-28 22:54:37,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 105.0) internal successors, (1995), 19 states have internal predecessors, (1995), 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-10-28 22:54:37,779 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 105.0) internal successors, (1995), 19 states have internal predecessors, (1995), 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-10-28 22:54:37,779 INFO L186 Difference]: Start difference. First operand has 150 places, 109 transitions, 544 flow. Second operand 18 states and 1562 transitions. [2021-10-28 22:54:37,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 152 transitions, 1247 flow [2021-10-28 22:54:37,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 1173 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-10-28 22:54:37,813 INFO L242 Difference]: Finished difference. Result has 164 places, 112 transitions, 634 flow [2021-10-28 22:54:37,814 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=634, PETRI_PLACES=164, PETRI_TRANSITIONS=112} [2021-10-28 22:54:37,814 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 54 predicate places. [2021-10-28 22:54:37,814 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 112 transitions, 634 flow [2021-10-28 22:54:37,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.27272727272727) internal successors, (927), 11 states have internal predecessors, (927), 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-10-28 22:54:37,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:37,816 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] [2021-10-28 22:54:37,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:54:37,816 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1102431185, now seen corresponding path program 1 times [2021-10-28 22:54:37,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:37,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968259785] [2021-10-28 22:54:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:37,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:37,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:37,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968259785] [2021-10-28 22:54:37,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968259785] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:37,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:37,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:54:37,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804133633] [2021-10-28 22:54:37,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:54:37,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:54:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:54:37,950 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-10-28 22:54:37,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 112 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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-10-28 22:54:37,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:37,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-10-28 22:54:37,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:39,187 INFO L129 PetriNetUnfolder]: 1838/4663 cut-off events. [2021-10-28 22:54:39,187 INFO L130 PetriNetUnfolder]: For 21260/21506 co-relation queries the response was YES. [2021-10-28 22:54:39,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13874 conditions, 4663 events. 1838/4663 cut-off events. For 21260/21506 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 47199 event pairs, 370 based on Foata normal form. 24/4175 useless extension candidates. Maximal degree in co-relation 13775. Up to 1177 conditions per place. [2021-10-28 22:54:39,308 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 24 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2021-10-28 22:54:39,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 139 transitions, 750 flow [2021-10-28 22:54:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 22:54:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 22:54:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2021-10-28 22:54:39,312 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9076190476190477 [2021-10-28 22:54:39,312 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2021-10-28 22:54:39,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2021-10-28 22:54:39,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:39,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2021-10-28 22:54:39,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:39,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 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-10-28 22:54:39,323 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 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-10-28 22:54:39,323 INFO L186 Difference]: Start difference. First operand has 164 places, 112 transitions, 634 flow. Second operand 10 states and 953 transitions. [2021-10-28 22:54:39,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 139 transitions, 750 flow [2021-10-28 22:54:39,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 139 transitions, 693 flow, removed 15 selfloop flow, removed 16 redundant places. [2021-10-28 22:54:39,407 INFO L242 Difference]: Finished difference. Result has 154 places, 124 transitions, 671 flow [2021-10-28 22:54:39,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=671, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2021-10-28 22:54:39,409 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 44 predicate places. [2021-10-28 22:54:39,409 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 671 flow [2021-10-28 22:54:39,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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-10-28 22:54:39,410 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:39,410 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] [2021-10-28 22:54:39,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:54:39,411 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1649979189, now seen corresponding path program 1 times [2021-10-28 22:54:39,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:39,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596804428] [2021-10-28 22:54:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:39,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:39,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:39,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596804428] [2021-10-28 22:54:39,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596804428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:39,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:39,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:54:39,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264650249] [2021-10-28 22:54:39,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:54:39,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:54:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:54:39,596 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-10-28 22:54:39,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 671 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:39,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:39,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-10-28 22:54:39,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:40,735 INFO L129 PetriNetUnfolder]: 1508/4151 cut-off events. [2021-10-28 22:54:40,735 INFO L130 PetriNetUnfolder]: For 14193/18022 co-relation queries the response was YES. [2021-10-28 22:54:40,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15014 conditions, 4151 events. 1508/4151 cut-off events. For 14193/18022 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 44869 event pairs, 22 based on Foata normal form. 732/4508 useless extension candidates. Maximal degree in co-relation 14921. Up to 1504 conditions per place. [2021-10-28 22:54:40,827 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 32 changer transitions 11/157 dead transitions. [2021-10-28 22:54:40,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 157 transitions, 999 flow [2021-10-28 22:54:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 22:54:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 22:54:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1240 transitions. [2021-10-28 22:54:40,832 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2021-10-28 22:54:40,833 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1240 transitions. [2021-10-28 22:54:40,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1240 transitions. [2021-10-28 22:54:40,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:40,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1240 transitions. [2021-10-28 22:54:40,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.38461538461539) internal successors, (1240), 13 states have internal predecessors, (1240), 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-10-28 22:54:40,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 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-10-28 22:54:40,850 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 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-10-28 22:54:40,851 INFO L186 Difference]: Start difference. First operand has 154 places, 124 transitions, 671 flow. Second operand 13 states and 1240 transitions. [2021-10-28 22:54:40,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 157 transitions, 999 flow [2021-10-28 22:54:40,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 157 transitions, 991 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-10-28 22:54:40,913 INFO L242 Difference]: Finished difference. Result has 168 places, 140 transitions, 875 flow [2021-10-28 22:54:40,913 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=875, PETRI_PLACES=168, PETRI_TRANSITIONS=140} [2021-10-28 22:54:40,914 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 58 predicate places. [2021-10-28 22:54:40,914 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 140 transitions, 875 flow [2021-10-28 22:54:40,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:40,915 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:40,915 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:40,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:54:40,916 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -265636811, now seen corresponding path program 1 times [2021-10-28 22:54:40,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:40,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962605883] [2021-10-28 22:54:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:40,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:41,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:41,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962605883] [2021-10-28 22:54:41,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962605883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:41,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:41,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 22:54:41,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137512765] [2021-10-28 22:54:41,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 22:54:41,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 22:54:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 22:54:41,118 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-10-28 22:54:41,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 140 transitions, 875 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:41,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:41,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-10-28 22:54:41,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:42,265 INFO L129 PetriNetUnfolder]: 1206/3678 cut-off events. [2021-10-28 22:54:42,265 INFO L130 PetriNetUnfolder]: For 18639/24938 co-relation queries the response was YES. [2021-10-28 22:54:42,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15349 conditions, 3678 events. 1206/3678 cut-off events. For 18639/24938 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 41866 event pairs, 0 based on Foata normal form. 790/4107 useless extension candidates. Maximal degree in co-relation 15251. Up to 1211 conditions per place. [2021-10-28 22:54:42,311 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 16 selfloop transitions, 36 changer transitions 20/166 dead transitions. [2021-10-28 22:54:42,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 166 transitions, 1193 flow [2021-10-28 22:54:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 22:54:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 22:54:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1512 transitions. [2021-10-28 22:54:42,316 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-10-28 22:54:42,316 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1512 transitions. [2021-10-28 22:54:42,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1512 transitions. [2021-10-28 22:54:42,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:42,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1512 transitions. [2021-10-28 22:54:42,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 94.5) internal successors, (1512), 16 states have internal predecessors, (1512), 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-10-28 22:54:42,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 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-10-28 22:54:42,329 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 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-10-28 22:54:42,329 INFO L186 Difference]: Start difference. First operand has 168 places, 140 transitions, 875 flow. Second operand 16 states and 1512 transitions. [2021-10-28 22:54:42,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 166 transitions, 1193 flow [2021-10-28 22:54:42,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 936 flow, removed 111 selfloop flow, removed 18 redundant places. [2021-10-28 22:54:42,773 INFO L242 Difference]: Finished difference. Result has 172 places, 140 transitions, 768 flow [2021-10-28 22:54:42,773 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=768, PETRI_PLACES=172, PETRI_TRANSITIONS=140} [2021-10-28 22:54:42,773 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 62 predicate places. [2021-10-28 22:54:42,773 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 140 transitions, 768 flow [2021-10-28 22:54:42,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:54:42,775 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:42,775 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:42,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:54:42,775 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1900353828, now seen corresponding path program 1 times [2021-10-28 22:54:42,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:42,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061954723] [2021-10-28 22:54:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:42,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:54:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:54:43,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:54:43,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061954723] [2021-10-28 22:54:43,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061954723] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:54:43,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:54:43,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 22:54:43,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684241753] [2021-10-28 22:54:43,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 22:54:43,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:54:43,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 22:54:43,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-10-28 22:54:43,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 105 [2021-10-28 22:54:43,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 140 transitions, 768 flow. Second operand has 12 states, 12 states have (on average 83.58333333333333) internal successors, (1003), 12 states have internal predecessors, (1003), 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-10-28 22:54:43,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 22:54:43,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 105 [2021-10-28 22:54:43,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 22:54:44,083 INFO L129 PetriNetUnfolder]: 902/3688 cut-off events. [2021-10-28 22:54:44,083 INFO L130 PetriNetUnfolder]: For 10085/10577 co-relation queries the response was YES. [2021-10-28 22:54:44,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11715 conditions, 3688 events. 902/3688 cut-off events. For 10085/10577 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 46037 event pairs, 0 based on Foata normal form. 21/3471 useless extension candidates. Maximal degree in co-relation 11617. Up to 459 conditions per place. [2021-10-28 22:54:44,118 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 19 selfloop transitions, 9 changer transitions 22/154 dead transitions. [2021-10-28 22:54:44,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 154 transitions, 989 flow [2021-10-28 22:54:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 22:54:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 22:54:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 851 transitions. [2021-10-28 22:54:44,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8104761904761905 [2021-10-28 22:54:44,121 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 851 transitions. [2021-10-28 22:54:44,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 851 transitions. [2021-10-28 22:54:44,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 22:54:44,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 851 transitions. [2021-10-28 22:54:44,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 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-10-28 22:54:44,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 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-10-28 22:54:44,128 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 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-10-28 22:54:44,128 INFO L186 Difference]: Start difference. First operand has 172 places, 140 transitions, 768 flow. Second operand 10 states and 851 transitions. [2021-10-28 22:54:44,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 154 transitions, 989 flow [2021-10-28 22:54:44,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 154 transitions, 838 flow, removed 51 selfloop flow, removed 20 redundant places. [2021-10-28 22:54:44,399 INFO L242 Difference]: Finished difference. Result has 162 places, 131 transitions, 652 flow [2021-10-28 22:54:44,399 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=652, PETRI_PLACES=162, PETRI_TRANSITIONS=131} [2021-10-28 22:54:44,399 INFO L334 CegarLoopForPetriNet]: 110 programPoint places, 52 predicate places. [2021-10-28 22:54:44,400 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 131 transitions, 652 flow [2021-10-28 22:54:44,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.58333333333333) internal successors, (1003), 12 states have internal predecessors, (1003), 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-10-28 22:54:44,400 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 22:54:44,401 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:44,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 22:54:44,401 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 22:54:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:54:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 571769524, now seen corresponding path program 2 times [2021-10-28 22:54:44,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:54:44,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164194423] [2021-10-28 22:54:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:54:44,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:54:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:54:44,465 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:54:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:54:44,587 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:54:44,587 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 22:54:44,588 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:54:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:54:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 22:54:44,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 22:54:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 22:54:44,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:54:44,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 22:54:44,597 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:54:44,603 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 22:54:44,604 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 22:54:44,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 10:54:44 BasicIcfg [2021-10-28 22:54:44,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 22:54:44,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 22:54:44,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 22:54:44,786 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 22:54:44,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:54:26" (3/4) ... [2021-10-28 22:54:44,792 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 22:54:44,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 22:54:44,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 22:54:44,944 INFO L168 Benchmark]: Toolchain (without parser) took 21813.89 ms. Allocated memory was 109.1 MB in the beginning and 893.4 MB in the end (delta: 784.3 MB). Free memory was 70.8 MB in the beginning and 486.0 MB in the end (delta: -415.2 MB). Peak memory consumption was 367.7 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,945 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 109.1 MB. Free memory is still 88.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 22:54:44,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.97 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 70.1 MB in the end (delta: 465.2 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.40 ms. Allocated memory is still 109.1 MB. Free memory was 70.1 MB in the beginning and 67.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,946 INFO L168 Benchmark]: Boogie Preprocessor took 71.33 ms. Allocated memory is still 109.1 MB. Free memory was 67.4 MB in the beginning and 65.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,947 INFO L168 Benchmark]: RCFGBuilder took 2394.37 ms. Allocated memory is still 109.1 MB. Free memory was 65.2 MB in the beginning and 46.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,947 INFO L168 Benchmark]: TraceAbstraction took 18257.70 ms. Allocated memory was 109.1 MB in the beginning and 893.4 MB in the end (delta: 784.3 MB). Free memory was 45.3 MB in the beginning and 514.3 MB in the end (delta: -469.0 MB). Peak memory consumption was 315.0 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,948 INFO L168 Benchmark]: Witness Printer took 157.02 ms. Allocated memory is still 893.4 MB. Free memory was 514.3 MB in the beginning and 486.0 MB in the end (delta: 28.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-28 22:54:44,950 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.34 ms. Allocated memory is still 109.1 MB. Free memory is still 88.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 794.97 ms. Allocated memory is still 109.1 MB. Free memory was 70.6 MB in the beginning and 70.1 MB in the end (delta: 465.2 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 129.40 ms. Allocated memory is still 109.1 MB. Free memory was 70.1 MB in the beginning and 67.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.33 ms. Allocated memory is still 109.1 MB. Free memory was 67.4 MB in the beginning and 65.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2394.37 ms. Allocated memory is still 109.1 MB. Free memory was 65.2 MB in the beginning and 46.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18257.70 ms. Allocated memory was 109.1 MB in the beginning and 893.4 MB in the end (delta: 784.3 MB). Free memory was 45.3 MB in the beginning and 514.3 MB in the end (delta: -469.0 MB). Peak memory consumption was 315.0 MB. Max. memory is 16.1 GB. * Witness Printer took 157.02 ms. Allocated memory is still 893.4 MB. Free memory was 514.3 MB in the beginning and 486.0 MB in the end (delta: 28.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 3 z = 1 VAL [__unbuffered_cnt=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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 151 SDtfs, 491 SDslu, 571 SDs, 0 SdLazy, 1009 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=12, InterpolantAutomatonStates: 164, 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.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 5333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 22:54:45,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d8b6d5f-d4b4-4569-98bd-5f0fbe90f639/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...