./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ --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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:35:43,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:35:43,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:35:43,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:35:43,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:35:43,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:35:43,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:35:43,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:35:43,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:35:43,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:35:43,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:35:43,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:35:43,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:35:43,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:35:43,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:35:43,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:35:43,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:35:43,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:35:43,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:35:43,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:35:43,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:35:43,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:35:43,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:35:43,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:35:43,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:35:43,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:35:43,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:35:43,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:35:43,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:35:43,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:35:43,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:35:43,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:35:43,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:35:43,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:35:43,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:35:43,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:35:43,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:35:43,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:35:43,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:35:43,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:35:43,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:35:43,753 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:35:43,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:35:43,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:35:43,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:35:43,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:35:43,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:35:43,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:35:43,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:35:43,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:35:43,804 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:35:43,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:35:43,805 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:35:43,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:35:43,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:35:43,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:35:43,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:35:43,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:35:43,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:35:43,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:35:43,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:35:43,808 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:35:43,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:35:43,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:35:43,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:35:43,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:35:43,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:35:43,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:35:43,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:35:43,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:35:43,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:35:43,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:35:43,813 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:35:43,813 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:35:43,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:35:43,814 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_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/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_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2022-10-17 10:35:44,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:35:44,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:35:44,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:35:44,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:35:44,116 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:35:44,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2022-10-17 10:35:44,212 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/data/cd806fac3/6e42f292b3fe47e584fc4c788daad2fb/FLAG6178ab983 [2022-10-17 10:35:44,719 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:35:44,720 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2022-10-17 10:35:44,736 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/data/cd806fac3/6e42f292b3fe47e584fc4c788daad2fb/FLAG6178ab983 [2022-10-17 10:35:45,032 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/data/cd806fac3/6e42f292b3fe47e584fc4c788daad2fb [2022-10-17 10:35:45,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:35:45,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:35:45,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:35:45,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:35:45,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:35:45,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:45,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eea1e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45, skipping insertion in model container [2022-10-17 10:35:45,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:45,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:35:45,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:35:45,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-10-17 10:35:45,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:35:45,762 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:35:45,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-10-17 10:35:45,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:35:45,903 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:35:45,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45 WrapperNode [2022-10-17 10:35:45,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:35:45,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:35:45,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:35:45,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:35:45,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:45,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,018 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-10-17 10:35:46,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:35:46,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:35:46,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:35:46,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:35:46,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,066 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:35:46,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:35:46,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:35:46,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:35:46,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (1/1) ... [2022-10-17 10:35:46,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:35:46,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:46,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:35:46,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:35:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:35:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:35:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:35:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:35:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:35:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:35:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:35:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:35:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:35:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:35:46,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:35:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:35:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:35:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:35:46,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:35:46,191 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:35:46,375 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:35:46,377 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:35:47,052 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:35:47,592 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:35:47,593 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:35:47,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:35:47 BoogieIcfgContainer [2022-10-17 10:35:47,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:35:47,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:35:47,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:35:47,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:35:47,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:35:45" (1/3) ... [2022-10-17 10:35:47,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1727e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:35:47, skipping insertion in model container [2022-10-17 10:35:47,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:45" (2/3) ... [2022-10-17 10:35:47,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1727e61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:35:47, skipping insertion in model container [2022-10-17 10:35:47,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:35:47" (3/3) ... [2022-10-17 10:35:47,609 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-10-17 10:35:47,619 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:35:47,630 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:35:47,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:35:47,630 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:35:47,717 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:35:47,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-10-17 10:35:47,862 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-10-17 10:35:47,862 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:35:47,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-10-17 10:35:47,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-10-17 10:35:47,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-10-17 10:35:47,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:35:47,900 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@594be632, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:35:47,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:35:47,928 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-10-17 10:35:47,928 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:35:47,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:47,930 INFO L208 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] [2022-10-17 10:35:47,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -401119588, now seen corresponding path program 1 times [2022-10-17 10:35:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:47,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798790727] [2022-10-17 10:35:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:48,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798790727] [2022-10-17 10:35:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798790727] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:48,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:48,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657525308] [2022-10-17 10:35:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:48,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:48,693 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-10-17 10:35:48,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:48,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:48,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-10-17 10:35:48,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:48,924 INFO L130 PetriNetUnfolder]: 57/323 cut-off events. [2022-10-17 10:35:48,924 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-10-17 10:35:48,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1315 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2022-10-17 10:35:48,934 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-10-17 10:35:48,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2022-10-17 10:35:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:35:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2022-10-17 10:35:48,958 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2022-10-17 10:35:48,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2022-10-17 10:35:48,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2022-10-17 10:35:48,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:48,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2022-10-17 10:35:48,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:48,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:48,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:48,990 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2022-10-17 10:35:48,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2022-10-17 10:35:48,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:35:49,006 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-10-17 10:35:49,009 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-10-17 10:35:49,015 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-10-17 10:35:49,016 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-10-17 10:35:49,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:49,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:49,018 INFO L208 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] [2022-10-17 10:35:49,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:35:49,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash -824296931, now seen corresponding path program 1 times [2022-10-17 10:35:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64033602] [2022-10-17 10:35:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:49,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64033602] [2022-10-17 10:35:49,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64033602] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:49,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:49,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:35:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316904008] [2022-10-17 10:35:49,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:49,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:35:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:35:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:35:49,745 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-10-17 10:35:49,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:49,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:49,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-10-17 10:35:49,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:50,454 INFO L130 PetriNetUnfolder]: 330/1074 cut-off events. [2022-10-17 10:35:50,455 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-10-17 10:35:50,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 1074 events. 330/1074 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7255 event pairs, 53 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1651. Up to 257 conditions per place. [2022-10-17 10:35:50,466 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 45/144 dead transitions. [2022-10-17 10:35:50,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 144 transitions, 420 flow [2022-10-17 10:35:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:35:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:35:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 893 transitions. [2022-10-17 10:35:50,474 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2022-10-17 10:35:50,474 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 893 transitions. [2022-10-17 10:35:50,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 893 transitions. [2022-10-17 10:35:50,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:50,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 893 transitions. [2022-10-17 10:35:50,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:50,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:50,490 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:50,490 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 893 transitions. [2022-10-17 10:35:50,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 144 transitions, 420 flow [2022-10-17 10:35:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 144 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:35:50,498 INFO L231 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-10-17 10:35:50,498 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-10-17 10:35:50,500 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-10-17 10:35:50,500 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-10-17 10:35:50,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:50,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:50,501 INFO L208 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] [2022-10-17 10:35:50,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:35:50,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash -969752196, now seen corresponding path program 1 times [2022-10-17 10:35:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:50,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754628379] [2022-10-17 10:35:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754628379] [2022-10-17 10:35:50,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754628379] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:50,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:50,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:35:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596982266] [2022-10-17 10:35:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:50,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:35:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:35:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:50,955 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-10-17 10:35:50,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:50,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:50,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-10-17 10:35:50,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:51,508 INFO L130 PetriNetUnfolder]: 268/661 cut-off events. [2022-10-17 10:35:51,508 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-10-17 10:35:51,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 661 events. 268/661 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3726 event pairs, 54 based on Foata normal form. 16/649 useless extension candidates. Maximal degree in co-relation 1252. Up to 141 conditions per place. [2022-10-17 10:35:51,515 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 20 selfloop transitions, 4 changer transitions 32/133 dead transitions. [2022-10-17 10:35:51,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 133 transitions, 429 flow [2022-10-17 10:35:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:35:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:35:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 968 transitions. [2022-10-17 10:35:51,521 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8491228070175438 [2022-10-17 10:35:51,522 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 968 transitions. [2022-10-17 10:35:51,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 968 transitions. [2022-10-17 10:35:51,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:51,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 968 transitions. [2022-10-17 10:35:51,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:51,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:51,534 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:51,534 INFO L175 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 10 states and 968 transitions. [2022-10-17 10:35:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 133 transitions, 429 flow [2022-10-17 10:35:51,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 395 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-10-17 10:35:51,546 INFO L231 Difference]: Finished difference. Result has 120 places, 95 transitions, 230 flow [2022-10-17 10:35:51,547 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2022-10-17 10:35:51,549 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2022-10-17 10:35:51,550 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 230 flow [2022-10-17 10:35:51,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:51,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:51,551 INFO L208 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] [2022-10-17 10:35:51,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:35:51,552 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1825514761, now seen corresponding path program 1 times [2022-10-17 10:35:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833815093] [2022-10-17 10:35:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:51,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833815093] [2022-10-17 10:35:51,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833815093] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:51,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:51,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:35:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460271719] [2022-10-17 10:35:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:51,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:35:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:35:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:35:51,960 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-10-17 10:35:51,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:51,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:51,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-10-17 10:35:51,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:52,447 INFO L130 PetriNetUnfolder]: 326/791 cut-off events. [2022-10-17 10:35:52,448 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-10-17 10:35:52,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 791 events. 326/791 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4051 event pairs, 161 based on Foata normal form. 18/771 useless extension candidates. Maximal degree in co-relation 1560. Up to 332 conditions per place. [2022-10-17 10:35:52,457 INFO L137 encePairwiseOnDemand]: 107/114 looper letters, 21 selfloop transitions, 3 changer transitions 31/133 dead transitions. [2022-10-17 10:35:52,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 133 transitions, 442 flow [2022-10-17 10:35:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:35:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:35:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions. [2022-10-17 10:35:52,462 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8625730994152047 [2022-10-17 10:35:52,462 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 885 transitions. [2022-10-17 10:35:52,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions. [2022-10-17 10:35:52,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:52,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions. [2022-10-17 10:35:52,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:52,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:52,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:52,476 INFO L175 Difference]: Start difference. First operand has 120 places, 95 transitions, 230 flow. Second operand 9 states and 885 transitions. [2022-10-17 10:35:52,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 133 transitions, 442 flow [2022-10-17 10:35:52,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 396 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-10-17 10:35:52,491 INFO L231 Difference]: Finished difference. Result has 119 places, 97 transitions, 247 flow [2022-10-17 10:35:52,492 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=119, PETRI_TRANSITIONS=97} [2022-10-17 10:35:52,495 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 0 predicate places. [2022-10-17 10:35:52,496 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 97 transitions, 247 flow [2022-10-17 10:35:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:52,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:52,497 INFO L208 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] [2022-10-17 10:35:52,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:35:52,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1014147123, now seen corresponding path program 1 times [2022-10-17 10:35:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:52,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687559566] [2022-10-17 10:35:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:52,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687559566] [2022-10-17 10:35:52,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687559566] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:52,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:52,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:35:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120376058] [2022-10-17 10:35:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:35:52,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:35:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:35:52,876 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-10-17 10:35:52,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 97 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:52,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:52,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-10-17 10:35:52,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:53,413 INFO L130 PetriNetUnfolder]: 358/930 cut-off events. [2022-10-17 10:35:53,413 INFO L131 PetriNetUnfolder]: For 685/691 co-relation queries the response was YES. [2022-10-17 10:35:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 930 events. 358/930 cut-off events. For 685/691 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5491 event pairs, 106 based on Foata normal form. 20/913 useless extension candidates. Maximal degree in co-relation 2016. Up to 243 conditions per place. [2022-10-17 10:35:53,423 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 24 selfloop transitions, 3 changer transitions 28/133 dead transitions. [2022-10-17 10:35:53,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 485 flow [2022-10-17 10:35:53,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:35:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:35:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 884 transitions. [2022-10-17 10:35:53,427 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8615984405458089 [2022-10-17 10:35:53,427 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 884 transitions. [2022-10-17 10:35:53,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 884 transitions. [2022-10-17 10:35:53,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:53,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 884 transitions. [2022-10-17 10:35:53,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.22222222222223) internal successors, (884), 9 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:53,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:53,435 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:53,435 INFO L175 Difference]: Start difference. First operand has 119 places, 97 transitions, 247 flow. Second operand 9 states and 884 transitions. [2022-10-17 10:35:53,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 485 flow [2022-10-17 10:35:53,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 454 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-10-17 10:35:53,442 INFO L231 Difference]: Finished difference. Result has 124 places, 97 transitions, 259 flow [2022-10-17 10:35:53,443 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=124, PETRI_TRANSITIONS=97} [2022-10-17 10:35:53,444 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 5 predicate places. [2022-10-17 10:35:53,444 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 97 transitions, 259 flow [2022-10-17 10:35:53,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:53,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:53,445 INFO L208 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] [2022-10-17 10:35:53,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:35:53,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:53,446 INFO L85 PathProgramCache]: Analyzing trace with hash 672625300, now seen corresponding path program 1 times [2022-10-17 10:35:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:53,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364566030] [2022-10-17 10:35:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:54,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:54,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364566030] [2022-10-17 10:35:54,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364566030] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:54,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:54,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-17 10:35:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067583047] [2022-10-17 10:35:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:54,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:35:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:35:54,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:35:54,436 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-10-17 10:35:54,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 97 transitions, 259 flow. Second operand has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:54,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:54,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-10-17 10:35:54,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:55,167 INFO L130 PetriNetUnfolder]: 409/1104 cut-off events. [2022-10-17 10:35:55,167 INFO L131 PetriNetUnfolder]: For 1324/1338 co-relation queries the response was YES. [2022-10-17 10:35:55,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1104 events. 409/1104 cut-off events. For 1324/1338 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6803 event pairs, 220 based on Foata normal form. 30/1062 useless extension candidates. Maximal degree in co-relation 2437. Up to 423 conditions per place. [2022-10-17 10:35:55,179 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 20 selfloop transitions, 9 changer transitions 28/135 dead transitions. [2022-10-17 10:35:55,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 135 transitions, 485 flow [2022-10-17 10:35:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:35:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-10-17 10:35:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1139 transitions. [2022-10-17 10:35:55,184 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8326023391812866 [2022-10-17 10:35:55,184 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1139 transitions. [2022-10-17 10:35:55,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1139 transitions. [2022-10-17 10:35:55,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:55,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1139 transitions. [2022-10-17 10:35:55,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.91666666666667) internal successors, (1139), 12 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:55,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:55,193 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:55,194 INFO L175 Difference]: Start difference. First operand has 124 places, 97 transitions, 259 flow. Second operand 12 states and 1139 transitions. [2022-10-17 10:35:55,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 135 transitions, 485 flow [2022-10-17 10:35:55,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 135 transitions, 448 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-10-17 10:35:55,206 INFO L231 Difference]: Finished difference. Result has 130 places, 102 transitions, 309 flow [2022-10-17 10:35:55,206 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=309, PETRI_PLACES=130, PETRI_TRANSITIONS=102} [2022-10-17 10:35:55,207 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2022-10-17 10:35:55,207 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 102 transitions, 309 flow [2022-10-17 10:35:55,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:55,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:55,208 INFO L208 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] [2022-10-17 10:35:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:35:55,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1280291599, now seen corresponding path program 1 times [2022-10-17 10:35:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:55,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388038653] [2022-10-17 10:35:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:56,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388038653] [2022-10-17 10:35:56,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388038653] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:56,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:56,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:35:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328882969] [2022-10-17 10:35:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:56,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:35:56,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:56,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:35:56,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:35:56,296 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-10-17 10:35:56,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 102 transitions, 309 flow. Second operand has 10 states, 10 states have (on average 92.5) internal successors, (925), 10 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:56,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:56,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-10-17 10:35:56,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:56,975 INFO L130 PetriNetUnfolder]: 390/1036 cut-off events. [2022-10-17 10:35:56,975 INFO L131 PetriNetUnfolder]: For 2803/2934 co-relation queries the response was YES. [2022-10-17 10:35:56,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 1036 events. 390/1036 cut-off events. For 2803/2934 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6471 event pairs, 115 based on Foata normal form. 27/1009 useless extension candidates. Maximal degree in co-relation 3294. Up to 377 conditions per place. [2022-10-17 10:35:56,987 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 26 selfloop transitions, 8 changer transitions 25/138 dead transitions. [2022-10-17 10:35:56,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 138 transitions, 667 flow [2022-10-17 10:35:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:35:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:35:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1057 transitions. [2022-10-17 10:35:56,992 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8429027113237639 [2022-10-17 10:35:56,992 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1057 transitions. [2022-10-17 10:35:56,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1057 transitions. [2022-10-17 10:35:56,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:56,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1057 transitions. [2022-10-17 10:35:56,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.0909090909091) internal successors, (1057), 11 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:57,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:57,002 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:57,002 INFO L175 Difference]: Start difference. First operand has 130 places, 102 transitions, 309 flow. Second operand 11 states and 1057 transitions. [2022-10-17 10:35:57,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 138 transitions, 667 flow [2022-10-17 10:35:57,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 138 transitions, 643 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-10-17 10:35:57,015 INFO L231 Difference]: Finished difference. Result has 136 places, 105 transitions, 381 flow [2022-10-17 10:35:57,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=381, PETRI_PLACES=136, PETRI_TRANSITIONS=105} [2022-10-17 10:35:57,017 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-10-17 10:35:57,017 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 105 transitions, 381 flow [2022-10-17 10:35:57,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.5) internal successors, (925), 10 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:57,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:57,018 INFO L208 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] [2022-10-17 10:35:57,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:35:57,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2042900006, now seen corresponding path program 1 times [2022-10-17 10:35:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:57,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63300169] [2022-10-17 10:35:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:57,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63300169] [2022-10-17 10:35:57,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63300169] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:57,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:57,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:35:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675722759] [2022-10-17 10:35:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:57,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:35:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:35:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:35:57,324 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-10-17 10:35:57,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 105 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:57,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:57,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-10-17 10:35:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:58,514 INFO L130 PetriNetUnfolder]: 1634/3252 cut-off events. [2022-10-17 10:35:58,515 INFO L131 PetriNetUnfolder]: For 22755/23182 co-relation queries the response was YES. [2022-10-17 10:35:58,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12582 conditions, 3252 events. 1634/3252 cut-off events. For 22755/23182 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22723 event pairs, 77 based on Foata normal form. 163/3283 useless extension candidates. Maximal degree in co-relation 12506. Up to 1041 conditions per place. [2022-10-17 10:35:58,555 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 42 selfloop transitions, 6 changer transitions 65/192 dead transitions. [2022-10-17 10:35:58,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 192 transitions, 1274 flow [2022-10-17 10:35:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:35:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:35:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-10-17 10:35:58,560 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2022-10-17 10:35:58,560 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-10-17 10:35:58,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-10-17 10:35:58,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:58,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-10-17 10:35:58,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:58,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:58,571 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:58,571 INFO L175 Difference]: Start difference. First operand has 136 places, 105 transitions, 381 flow. Second operand 10 states and 982 transitions. [2022-10-17 10:35:58,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 192 transitions, 1274 flow [2022-10-17 10:35:58,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 192 transitions, 1205 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-10-17 10:35:58,597 INFO L231 Difference]: Finished difference. Result has 139 places, 108 transitions, 419 flow [2022-10-17 10:35:58,597 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=419, PETRI_PLACES=139, PETRI_TRANSITIONS=108} [2022-10-17 10:35:58,600 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 20 predicate places. [2022-10-17 10:35:58,600 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 108 transitions, 419 flow [2022-10-17 10:35:58,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:58,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:58,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:58,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:35:58,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1149144779, now seen corresponding path program 1 times [2022-10-17 10:35:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:58,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360542808] [2022-10-17 10:35:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360542808] [2022-10-17 10:35:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360542808] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:58,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:58,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:35:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411202195] [2022-10-17 10:35:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:58,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:35:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:35:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:58,903 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-10-17 10:35:58,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 108 transitions, 419 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) [2022-10-17 10:35:58,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:58,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-10-17 10:35:58,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:59,584 INFO L130 PetriNetUnfolder]: 651/1651 cut-off events. [2022-10-17 10:35:59,584 INFO L131 PetriNetUnfolder]: For 10552/10794 co-relation queries the response was YES. [2022-10-17 10:35:59,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6790 conditions, 1651 events. 651/1651 cut-off events. For 10552/10794 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11443 event pairs, 54 based on Foata normal form. 113/1730 useless extension candidates. Maximal degree in co-relation 6711. Up to 451 conditions per place. [2022-10-17 10:35:59,603 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 44 selfloop transitions, 9 changer transitions 41/173 dead transitions. [2022-10-17 10:35:59,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 173 transitions, 1218 flow [2022-10-17 10:35:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:35:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:35:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-10-17 10:35:59,608 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8570175438596491 [2022-10-17 10:35:59,608 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2022-10-17 10:35:59,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2022-10-17 10:35:59,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:59,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2022-10-17 10:35:59,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:59,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:59,617 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:59,617 INFO L175 Difference]: Start difference. First operand has 139 places, 108 transitions, 419 flow. Second operand 10 states and 977 transitions. [2022-10-17 10:35:59,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 173 transitions, 1218 flow [2022-10-17 10:35:59,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 173 transitions, 1205 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-10-17 10:35:59,656 INFO L231 Difference]: Finished difference. Result has 144 places, 111 transitions, 493 flow [2022-10-17 10:35:59,657 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=493, PETRI_PLACES=144, PETRI_TRANSITIONS=111} [2022-10-17 10:35:59,658 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-10-17 10:35:59,658 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 111 transitions, 493 flow [2022-10-17 10:35:59,659 INFO L496 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) [2022-10-17 10:35:59,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:59,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:59,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:35:59,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:35:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1358206785, now seen corresponding path program 1 times [2022-10-17 10:35:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:59,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177819442] [2022-10-17 10:35:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:00,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:00,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177819442] [2022-10-17 10:36:00,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177819442] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:00,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:00,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:36:00,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432954387] [2022-10-17 10:36:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:00,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:36:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:36:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:36:00,060 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-10-17 10:36:00,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 111 transitions, 493 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) [2022-10-17 10:36:00,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:36:00,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-10-17 10:36:00,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:36:00,507 INFO L130 PetriNetUnfolder]: 283/862 cut-off events. [2022-10-17 10:36:00,507 INFO L131 PetriNetUnfolder]: For 5699/5841 co-relation queries the response was YES. [2022-10-17 10:36:00,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3654 conditions, 862 events. 283/862 cut-off events. For 5699/5841 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5405 event pairs, 40 based on Foata normal form. 37/881 useless extension candidates. Maximal degree in co-relation 3587. Up to 218 conditions per place. [2022-10-17 10:36:00,517 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 29 selfloop transitions, 12 changer transitions 27/146 dead transitions. [2022-10-17 10:36:00,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 994 flow [2022-10-17 10:36:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:36:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:36:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1047 transitions. [2022-10-17 10:36:00,523 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8349282296650717 [2022-10-17 10:36:00,523 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1047 transitions. [2022-10-17 10:36:00,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1047 transitions. [2022-10-17 10:36:00,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:36:00,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1047 transitions. [2022-10-17 10:36:00,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.18181818181819) internal successors, (1047), 11 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:36:00,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:36:00,533 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:36:00,533 INFO L175 Difference]: Start difference. First operand has 144 places, 111 transitions, 493 flow. Second operand 11 states and 1047 transitions. [2022-10-17 10:36:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 994 flow [2022-10-17 10:36:00,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 146 transitions, 841 flow, removed 66 selfloop flow, removed 13 redundant places. [2022-10-17 10:36:00,554 INFO L231 Difference]: Finished difference. Result has 143 places, 108 transitions, 422 flow [2022-10-17 10:36:00,555 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=422, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2022-10-17 10:36:00,556 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2022-10-17 10:36:00,556 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 108 transitions, 422 flow [2022-10-17 10:36:00,557 INFO L496 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) [2022-10-17 10:36:00,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:36:00,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:00,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:36:00,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:36:00,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -545909448, now seen corresponding path program 1 times [2022-10-17 10:36:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:00,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364680656] [2022-10-17 10:36:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:36:00,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:36:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:36:00,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:36:00,797 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:36:00,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:36:00,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:36:00,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:36:00,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:36:00,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:36:00,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:36:00,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:36:00,802 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:00,809 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:36:00,809 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:36:01,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:36:01 BasicIcfg [2022-10-17 10:36:01,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:36:01,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:36:01,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:36:01,028 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:36:01,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:35:47" (3/4) ... [2022-10-17 10:36:01,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:36:01,201 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:36:01,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:36:01,203 INFO L158 Benchmark]: Toolchain (without parser) took 16163.28ms. Allocated memory was 113.2MB in the beginning and 339.7MB in the end (delta: 226.5MB). Free memory was 77.7MB in the beginning and 255.2MB in the end (delta: -177.6MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,203 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 84.5MB in the end (delta: 68.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:36:01,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 858.03ms. Allocated memory is still 113.2MB. Free memory was 77.4MB in the beginning and 74.5MB in the end (delta: 3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.78ms. Allocated memory is still 113.2MB. Free memory was 74.5MB in the beginning and 71.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,204 INFO L158 Benchmark]: Boogie Preprocessor took 60.47ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 69.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,204 INFO L158 Benchmark]: RCFGBuilder took 1514.14ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 69.0MB in the beginning and 112.0MB in the end (delta: -42.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,205 INFO L158 Benchmark]: TraceAbstraction took 13425.83ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 112.0MB in the beginning and 282.5MB in the end (delta: -170.5MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,205 INFO L158 Benchmark]: Witness Printer took 174.17ms. Allocated memory is still 339.7MB. Free memory was 282.5MB in the beginning and 255.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-10-17 10:36:01,208 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.29ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 84.5MB in the end (delta: 68.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 858.03ms. Allocated memory is still 113.2MB. Free memory was 77.4MB in the beginning and 74.5MB in the end (delta: 3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.78ms. Allocated memory is still 113.2MB. Free memory was 74.5MB in the beginning and 71.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.47ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 69.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1514.14ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 69.0MB in the beginning and 112.0MB in the end (delta: -42.9MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13425.83ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 112.0MB in the beginning and 282.5MB in the end (delta: -170.5MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. * Witness Printer took 174.17ms. Allocated memory is still 339.7MB. Free memory was 282.5MB in the beginning and 255.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t2028; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028, ((void *)0), P0, ((void *)0))=-2, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029, ((void *)0), P1, ((void *)0))=-1, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2030; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2030, ((void *)0), P2, ((void *)0))=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 310 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 72 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 755 ConstructedInterpolants, 0 QuantifiedInterpolants, 2787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:36:01,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9fa8298-74e7-48b5-9491-2d1b83b7044f/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE