./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a --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 3fc7a688cbe32836e1b8ce30abe37b248e61f96ae5014519dab91b2515bcd4ed --- 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-b5237d8 [2022-11-21 17:22:16,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:22:16,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:22:16,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:22:16,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:22:16,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:22:16,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:22:16,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:22:16,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:22:16,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:22:16,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:22:16,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:22:16,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:22:16,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:22:16,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:22:16,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:22:16,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:22:16,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:22:16,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:22:16,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:22:16,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:22:16,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:22:16,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:22:16,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:22:16,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:22:16,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:22:16,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:22:16,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:22:16,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:22:16,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:22:16,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:22:16,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:22:16,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:22:16,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:22:16,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:22:16,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:22:16,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:22:16,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:22:16,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:22:16,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:22:16,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:22:16,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 17:22:16,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:22:16,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:22:16,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:22:16,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:22:16,837 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:22:16,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:22:16,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:22:16,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:22:16,839 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:22:16,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:22:16,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:22:16,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:22:16,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:22:16,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:22:16,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:22:16,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:22:16,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:22:16,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:22:16,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:22:16,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:22:16,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:22:16,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:22:16,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:22:16,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:22:16,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:22:16,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:22:16,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:22:16,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:22:16,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:22:16,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:22:16,846 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:22:16,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:22:16,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:22:16,846 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_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/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_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a 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 -> 3fc7a688cbe32836e1b8ce30abe37b248e61f96ae5014519dab91b2515bcd4ed [2022-11-21 17:22:17,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:22:17,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:22:17,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:22:17,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:22:17,191 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:22:17,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-11-21 17:22:20,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:22:21,010 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:22:21,011 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-11-21 17:22:21,028 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/data/5280a3fd0/4fbc8c36ba64424b859b931c62d4e763/FLAGeba56cf38 [2022-11-21 17:22:21,046 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/data/5280a3fd0/4fbc8c36ba64424b859b931c62d4e763 [2022-11-21 17:22:21,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:22:21,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:22:21,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:22:21,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:22:21,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:22:21,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd45c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21, skipping insertion in model container [2022-11-21 17:22:21,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:22:21,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:22:21,314 WARN L237 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_98cd7951-e0a7-463c-979a-d4102370cc8a/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014] [2022-11-21 17:22:21,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:22:21,599 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:22:21,614 WARN L237 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_98cd7951-e0a7-463c-979a-d4102370cc8a/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014] [2022-11-21 17:22:21,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:22:21,701 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:22:21,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21 WrapperNode [2022-11-21 17:22:21,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:22:21,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:22:21,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:22:21,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:22:21,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,758 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-21 17:22:21,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:22:21,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:22:21,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:22:21,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:22:21,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:22:21,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:22:21,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:22:21,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:22:21,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (1/1) ... [2022-11-21 17:22:21,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:22:21,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:22:21,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:22:21,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:22:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:22:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 17:22:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:22:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:22:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:22:21,895 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 17:22:21,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 17:22:21,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 17:22:21,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 17:22:21,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 17:22:21,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 17:22:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:22:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 17:22:21,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:22:21,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:22:21,898 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:22:22,062 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:22:22,065 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:22:22,513 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:22:22,710 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:22:22,710 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:22:22,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:22:22 BoogieIcfgContainer [2022-11-21 17:22:22,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:22:22,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:22:22,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:22:22,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:22:22,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:22:21" (1/3) ... [2022-11-21 17:22:22,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cb3aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:22:22, skipping insertion in model container [2022-11-21 17:22:22,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:22:21" (2/3) ... [2022-11-21 17:22:22,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cb3aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:22:22, skipping insertion in model container [2022-11-21 17:22:22,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:22:22" (3/3) ... [2022-11-21 17:22:22,729 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2022-11-21 17:22:22,742 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 17:22:22,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:22:22,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 17:22:22,777 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:22:22,853 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:22:22,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-21 17:22:23,020 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-21 17:22:23,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:22:23,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-21 17:22:23,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-21 17:22:23,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-21 17:22:23,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:22:23,053 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;@16f23080, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:22:23,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 17:22:23,082 INFO L130 PetriNetUnfolder]: 0/60 cut-off events. [2022-11-21 17:22:23,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:22:23,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:23,084 INFO L209 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] [2022-11-21 17:22:23,085 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-11-21 17:22:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 991950025, now seen corresponding path program 1 times [2022-11-21 17:22:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:23,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663893958] [2022-11-21 17:22:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:23,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:23,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663893958] [2022-11-21 17:22:23,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663893958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:23,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:23,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:22:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446026347] [2022-11-21 17:22:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:23,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:22:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:22:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:22:23,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-11-21 17:22:23,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-11-21 17:22:23,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:23,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-11-21 17:22:23,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:24,099 INFO L130 PetriNetUnfolder]: 37/225 cut-off events. [2022-11-21 17:22:24,099 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 17:22:24,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 225 events. 37/225 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 706 event pairs, 7 based on Foata normal form. 13/222 useless extension candidates. Maximal degree in co-relation 264. Up to 51 conditions per place. [2022-11-21 17:22:24,105 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 11 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2022-11-21 17:22:24,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 114 transitions, 266 flow [2022-11-21 17:22:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:22:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:22:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-21 17:22:24,123 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-11-21 17:22:24,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-21 17:22:24,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-21 17:22:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:24,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-21 17:22:24,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-11-21 17:22:24,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-11-21 17:22:24,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-11-21 17:22:24,148 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 330 transitions. [2022-11-21 17:22:24,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 114 transitions, 266 flow [2022-11-21 17:22:24,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 114 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 17:22:24,166 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-11-21 17:22:24,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-11-21 17:22:24,177 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-11-21 17:22:24,177 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-11-21 17:22:24,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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-11-21 17:22:24,178 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:24,179 INFO L209 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] [2022-11-21 17:22:24,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:22:24,179 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-11-21 17:22:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1439521535, now seen corresponding path program 1 times [2022-11-21 17:22:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:24,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603951608] [2022-11-21 17:22:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:24,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603951608] [2022-11-21 17:22:24,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603951608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:24,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:24,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:22:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137550519] [2022-11-21 17:22:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:24,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:22:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:22:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:22:24,851 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-21 17:22:24,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 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-11-21 17:22:24,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:24,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-21 17:22:24,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:25,823 INFO L130 PetriNetUnfolder]: 680/1906 cut-off events. [2022-11-21 17:22:25,823 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-11-21 17:22:25,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 1906 events. 680/1906 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13948 event pairs, 136 based on Foata normal form. 0/1849 useless extension candidates. Maximal degree in co-relation 3032. Up to 555 conditions per place. [2022-11-21 17:22:25,845 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 24 selfloop transitions, 2 changer transitions 54/157 dead transitions. [2022-11-21 17:22:25,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 157 transitions, 476 flow [2022-11-21 17:22:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:22:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 17:22:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-11-21 17:22:25,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8452041785375118 [2022-11-21 17:22:25,857 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-11-21 17:22:25,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-11-21 17:22:25,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:25,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-11-21 17:22:25,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 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-11-21 17:22:25,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-11-21 17:22:25,872 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 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-11-21 17:22:25,872 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 9 states and 890 transitions. [2022-11-21 17:22:25,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 157 transitions, 476 flow [2022-11-21 17:22:25,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 157 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:22:25,881 INFO L231 Difference]: Finished difference. Result has 132 places, 98 transitions, 222 flow [2022-11-21 17:22:25,881 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=132, PETRI_TRANSITIONS=98} [2022-11-21 17:22:25,882 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2022-11-21 17:22:25,883 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 222 flow [2022-11-21 17:22:25,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 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-11-21 17:22:25,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:25,884 INFO L209 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-11-21 17:22:25,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:22:25,885 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-11-21 17:22:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -452069994, now seen corresponding path program 1 times [2022-11-21 17:22:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151778115] [2022-11-21 17:22:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:25,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:26,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:26,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151778115] [2022-11-21 17:22:26,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151778115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:26,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:26,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:22:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489189699] [2022-11-21 17:22:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:26,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:22:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:22:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:22:26,309 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-21 17:22:26,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 98 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 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-11-21 17:22:26,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:26,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-21 17:22:26,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:26,993 INFO L130 PetriNetUnfolder]: 683/1535 cut-off events. [2022-11-21 17:22:26,994 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-11-21 17:22:27,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1535 events. 683/1535 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10204 event pairs, 39 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 2771. Up to 379 conditions per place. [2022-11-21 17:22:27,009 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 28 selfloop transitions, 6 changer transitions 45/158 dead transitions. [2022-11-21 17:22:27,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 158 transitions, 504 flow [2022-11-21 17:22:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:22:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 17:22:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1021 transitions. [2022-11-21 17:22:27,014 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8726495726495727 [2022-11-21 17:22:27,014 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1021 transitions. [2022-11-21 17:22:27,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1021 transitions. [2022-11-21 17:22:27,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:27,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1021 transitions. [2022-11-21 17:22:27,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.1) internal successors, (1021), 10 states have internal predecessors, (1021), 0 states have call successors, (0), 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-11-21 17:22:27,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:27,026 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:27,026 INFO L175 Difference]: Start difference. First operand has 132 places, 98 transitions, 222 flow. Second operand 10 states and 1021 transitions. [2022-11-21 17:22:27,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 158 transitions, 504 flow [2022-11-21 17:22:27,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 158 transitions, 488 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-21 17:22:27,040 INFO L231 Difference]: Finished difference. Result has 121 places, 100 transitions, 260 flow [2022-11-21 17:22:27,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=260, PETRI_PLACES=121, PETRI_TRANSITIONS=100} [2022-11-21 17:22:27,042 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2022-11-21 17:22:27,043 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 100 transitions, 260 flow [2022-11-21 17:22:27,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 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-11-21 17:22:27,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:27,044 INFO L209 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-11-21 17:22:27,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:22:27,045 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-11-21 17:22:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1352952354, now seen corresponding path program 1 times [2022-11-21 17:22:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:27,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715405771] [2022-11-21 17:22:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:27,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715405771] [2022-11-21 17:22:27,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715405771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:27,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:27,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:22:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794499836] [2022-11-21 17:22:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:27,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:22:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:22:27,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:22:27,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-21 17:22:27,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 100 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 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-11-21 17:22:27,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:27,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-21 17:22:27,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:27,854 INFO L130 PetriNetUnfolder]: 249/711 cut-off events. [2022-11-21 17:22:27,854 INFO L131 PetriNetUnfolder]: For 612/614 co-relation queries the response was YES. [2022-11-21 17:22:27,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 711 events. 249/711 cut-off events. For 612/614 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3941 event pairs, 30 based on Foata normal form. 24/719 useless extension candidates. Maximal degree in co-relation 1702. Up to 160 conditions per place. [2022-11-21 17:22:27,860 INFO L137 encePairwiseOnDemand]: 108/117 looper letters, 33 selfloop transitions, 9 changer transitions 35/156 dead transitions. [2022-11-21 17:22:27,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 156 transitions, 659 flow [2022-11-21 17:22:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:22:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 17:22:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-11-21 17:22:27,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.870940170940171 [2022-11-21 17:22:27,865 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1019 transitions. [2022-11-21 17:22:27,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1019 transitions. [2022-11-21 17:22:27,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:27,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1019 transitions. [2022-11-21 17:22:27,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.9) internal successors, (1019), 10 states have internal predecessors, (1019), 0 states have call successors, (0), 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-11-21 17:22:27,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:27,880 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:27,880 INFO L175 Difference]: Start difference. First operand has 121 places, 100 transitions, 260 flow. Second operand 10 states and 1019 transitions. [2022-11-21 17:22:27,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 156 transitions, 659 flow [2022-11-21 17:22:27,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 156 transitions, 635 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-21 17:22:27,893 INFO L231 Difference]: Finished difference. Result has 125 places, 103 transitions, 328 flow [2022-11-21 17:22:27,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=328, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2022-11-21 17:22:27,895 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 3 predicate places. [2022-11-21 17:22:27,900 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 328 flow [2022-11-21 17:22:27,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 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-11-21 17:22:27,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:27,902 INFO L209 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] [2022-11-21 17:22:27,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:22:27,903 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-11-21 17:22:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash -311462372, now seen corresponding path program 1 times [2022-11-21 17:22:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165046280] [2022-11-21 17:22:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165046280] [2022-11-21 17:22:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165046280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:28,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:28,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:22:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087616971] [2022-11-21 17:22:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:22:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:22:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:22:28,396 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-21 17:22:28,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 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-11-21 17:22:28,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:28,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-21 17:22:28,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:28,770 INFO L130 PetriNetUnfolder]: 146/651 cut-off events. [2022-11-21 17:22:28,770 INFO L131 PetriNetUnfolder]: For 876/926 co-relation queries the response was YES. [2022-11-21 17:22:28,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 651 events. 146/651 cut-off events. For 876/926 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3622 event pairs, 30 based on Foata normal form. 15/646 useless extension candidates. Maximal degree in co-relation 1458. Up to 140 conditions per place. [2022-11-21 17:22:28,775 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 36 selfloop transitions, 2 changer transitions 17/140 dead transitions. [2022-11-21 17:22:28,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 140 transitions, 520 flow [2022-11-21 17:22:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:22:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 17:22:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 714 transitions. [2022-11-21 17:22:28,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2022-11-21 17:22:28,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 714 transitions. [2022-11-21 17:22:28,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 714 transitions. [2022-11-21 17:22:28,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:28,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 714 transitions. [2022-11-21 17:22:28,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 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-11-21 17:22:28,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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-11-21 17:22:28,784 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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-11-21 17:22:28,784 INFO L175 Difference]: Start difference. First operand has 125 places, 103 transitions, 328 flow. Second operand 7 states and 714 transitions. [2022-11-21 17:22:28,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 140 transitions, 520 flow [2022-11-21 17:22:28,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 140 transitions, 464 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-21 17:22:28,792 INFO L231 Difference]: Finished difference. Result has 123 places, 104 transitions, 291 flow [2022-11-21 17:22:28,792 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=123, PETRI_TRANSITIONS=104} [2022-11-21 17:22:28,793 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2022-11-21 17:22:28,793 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 104 transitions, 291 flow [2022-11-21 17:22:28,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 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-11-21 17:22:28,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:28,794 INFO L209 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] [2022-11-21 17:22:28,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:22:28,795 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-11-21 17:22:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash -692768514, now seen corresponding path program 2 times [2022-11-21 17:22:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:28,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362503254] [2022-11-21 17:22:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:29,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:29,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362503254] [2022-11-21 17:22:29,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362503254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:29,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:29,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:22:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795573857] [2022-11-21 17:22:29,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:29,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:22:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:22:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:22:29,183 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-11-21 17:22:29,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 104 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:29,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:29,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-11-21 17:22:29,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:29,596 INFO L130 PetriNetUnfolder]: 153/535 cut-off events. [2022-11-21 17:22:29,597 INFO L131 PetriNetUnfolder]: For 338/338 co-relation queries the response was YES. [2022-11-21 17:22:29,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 535 events. 153/535 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2876 event pairs, 26 based on Foata normal form. 16/533 useless extension candidates. Maximal degree in co-relation 1200. Up to 86 conditions per place. [2022-11-21 17:22:29,600 INFO L137 encePairwiseOnDemand]: 108/117 looper letters, 21 selfloop transitions, 12 changer transitions 24/136 dead transitions. [2022-11-21 17:22:29,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 136 transitions, 534 flow [2022-11-21 17:22:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:22:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 17:22:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1092 transitions. [2022-11-21 17:22:29,605 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2022-11-21 17:22:29,605 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1092 transitions. [2022-11-21 17:22:29,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1092 transitions. [2022-11-21 17:22:29,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:29,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1092 transitions. [2022-11-21 17:22:29,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.27272727272727) internal successors, (1092), 11 states have internal predecessors, (1092), 0 states have call successors, (0), 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-11-21 17:22:29,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 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-11-21 17:22:29,613 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 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-11-21 17:22:29,613 INFO L175 Difference]: Start difference. First operand has 123 places, 104 transitions, 291 flow. Second operand 11 states and 1092 transitions. [2022-11-21 17:22:29,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 136 transitions, 534 flow [2022-11-21 17:22:29,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 505 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-11-21 17:22:29,620 INFO L231 Difference]: Finished difference. Result has 131 places, 103 transitions, 314 flow [2022-11-21 17:22:29,620 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=314, PETRI_PLACES=131, PETRI_TRANSITIONS=103} [2022-11-21 17:22:29,621 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-11-21 17:22:29,621 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 103 transitions, 314 flow [2022-11-21 17:22:29,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:29,622 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:29,623 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:29,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:22:29,623 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-11-21 17:22:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash -266349970, now seen corresponding path program 1 times [2022-11-21 17:22:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:29,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47664693] [2022-11-21 17:22:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:30,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47664693] [2022-11-21 17:22:30,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47664693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:30,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:30,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 17:22:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916254796] [2022-11-21 17:22:30,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:30,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 17:22:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:30,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 17:22:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:22:30,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2022-11-21 17:22:30,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 103 transitions, 314 flow. Second operand has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 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-11-21 17:22:30,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:30,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2022-11-21 17:22:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:31,026 INFO L130 PetriNetUnfolder]: 101/416 cut-off events. [2022-11-21 17:22:31,027 INFO L131 PetriNetUnfolder]: For 222/229 co-relation queries the response was YES. [2022-11-21 17:22:31,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 416 events. 101/416 cut-off events. For 222/229 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1907 event pairs, 18 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 849. Up to 88 conditions per place. [2022-11-21 17:22:31,030 INFO L137 encePairwiseOnDemand]: 103/117 looper letters, 27 selfloop transitions, 17 changer transitions 6/128 dead transitions. [2022-11-21 17:22:31,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 128 transitions, 472 flow [2022-11-21 17:22:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:22:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 17:22:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 921 transitions. [2022-11-21 17:22:31,034 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7871794871794872 [2022-11-21 17:22:31,034 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 921 transitions. [2022-11-21 17:22:31,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 921 transitions. [2022-11-21 17:22:31,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:31,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 921 transitions. [2022-11-21 17:22:31,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.1) internal successors, (921), 10 states have internal predecessors, (921), 0 states have call successors, (0), 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-11-21 17:22:31,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:31,041 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:31,042 INFO L175 Difference]: Start difference. First operand has 131 places, 103 transitions, 314 flow. Second operand 10 states and 921 transitions. [2022-11-21 17:22:31,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 128 transitions, 472 flow [2022-11-21 17:22:31,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 128 transitions, 392 flow, removed 21 selfloop flow, removed 16 redundant places. [2022-11-21 17:22:31,047 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 361 flow [2022-11-21 17:22:31,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2022-11-21 17:22:31,049 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 4 predicate places. [2022-11-21 17:22:31,049 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 361 flow [2022-11-21 17:22:31,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 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-11-21 17:22:31,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:31,050 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:31,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:22:31,051 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-11-21 17:22:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 161198416, now seen corresponding path program 2 times [2022-11-21 17:22:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:31,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682596990] [2022-11-21 17:22:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:32,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682596990] [2022-11-21 17:22:32,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682596990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:32,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:32,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 17:22:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790655423] [2022-11-21 17:22:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:32,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 17:22:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 17:22:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:22:32,175 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-21 17:22:32,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 361 flow. Second operand has 9 states, 9 states have (on average 93.33333333333333) internal successors, (840), 9 states have internal predecessors, (840), 0 states have call successors, (0), 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-11-21 17:22:32,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:32,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-21 17:22:32,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:32,591 INFO L130 PetriNetUnfolder]: 91/517 cut-off events. [2022-11-21 17:22:32,592 INFO L131 PetriNetUnfolder]: For 185/191 co-relation queries the response was YES. [2022-11-21 17:22:32,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 517 events. 91/517 cut-off events. For 185/191 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3106 event pairs, 4 based on Foata normal form. 6/511 useless extension candidates. Maximal degree in co-relation 1001. Up to 60 conditions per place. [2022-11-21 17:22:32,595 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 26 selfloop transitions, 13 changer transitions 7/134 dead transitions. [2022-11-21 17:22:32,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 134 transitions, 525 flow [2022-11-21 17:22:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:22:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 17:22:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-11-21 17:22:32,599 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8094017094017094 [2022-11-21 17:22:32,600 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2022-11-21 17:22:32,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2022-11-21 17:22:32,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:32,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2022-11-21 17:22:32,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:22:32,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:32,607 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 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-11-21 17:22:32,607 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 361 flow. Second operand 10 states and 947 transitions. [2022-11-21 17:22:32,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 134 transitions, 525 flow [2022-11-21 17:22:32,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 513 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-21 17:22:32,612 INFO L231 Difference]: Finished difference. Result has 135 places, 123 transitions, 446 flow [2022-11-21 17:22:32,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=446, PETRI_PLACES=135, PETRI_TRANSITIONS=123} [2022-11-21 17:22:32,614 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 13 predicate places. [2022-11-21 17:22:32,614 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 123 transitions, 446 flow [2022-11-21 17:22:32,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.33333333333333) internal successors, (840), 9 states have internal predecessors, (840), 0 states have call successors, (0), 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-11-21 17:22:32,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:32,615 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:32,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:22:32,616 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-11-21 17:22:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2047305520, now seen corresponding path program 3 times [2022-11-21 17:22:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:32,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191039387] [2022-11-21 17:22:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:22:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:22:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:22:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191039387] [2022-11-21 17:22:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191039387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:22:33,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:22:33,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 17:22:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253056002] [2022-11-21 17:22:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:22:33,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 17:22:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:22:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 17:22:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:22:33,896 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-21 17:22:33,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 446 flow. Second operand has 11 states, 11 states have (on average 91.0909090909091) internal successors, (1002), 11 states have internal predecessors, (1002), 0 states have call successors, (0), 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-11-21 17:22:33,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:22:33,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-21 17:22:33,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:22:34,287 INFO L130 PetriNetUnfolder]: 90/522 cut-off events. [2022-11-21 17:22:34,287 INFO L131 PetriNetUnfolder]: For 461/473 co-relation queries the response was YES. [2022-11-21 17:22:34,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 522 events. 90/522 cut-off events. For 461/473 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3180 event pairs, 6 based on Foata normal form. 10/517 useless extension candidates. Maximal degree in co-relation 1145. Up to 60 conditions per place. [2022-11-21 17:22:34,291 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 26 selfloop transitions, 10 changer transitions 11/133 dead transitions. [2022-11-21 17:22:34,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 590 flow [2022-11-21 17:22:34,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:22:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 17:22:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1014 transitions. [2022-11-21 17:22:34,295 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2022-11-21 17:22:34,295 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1014 transitions. [2022-11-21 17:22:34,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1014 transitions. [2022-11-21 17:22:34,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:22:34,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1014 transitions. [2022-11-21 17:22:34,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 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-11-21 17:22:34,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 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-11-21 17:22:34,303 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 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-11-21 17:22:34,303 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 446 flow. Second operand 11 states and 1014 transitions. [2022-11-21 17:22:34,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 590 flow [2022-11-21 17:22:34,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 573 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-21 17:22:34,310 INFO L231 Difference]: Finished difference. Result has 141 places, 121 transitions, 455 flow [2022-11-21 17:22:34,310 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=141, PETRI_TRANSITIONS=121} [2022-11-21 17:22:34,311 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-11-21 17:22:34,311 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 121 transitions, 455 flow [2022-11-21 17:22:34,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.0909090909091) internal successors, (1002), 11 states have internal predecessors, (1002), 0 states have call successors, (0), 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-11-21 17:22:34,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:22:34,313 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:22:34,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:22:34,313 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-11-21 17:22:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:22:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 897815784, now seen corresponding path program 4 times [2022-11-21 17:22:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:22:34,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080129970] [2022-11-21 17:22:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:22:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:22:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:34,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:22:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:22:34,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:22:34,498 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:22:34,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-21 17:22:34,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 17:22:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-21 17:22:34,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-21 17:22:34,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-21 17:22:34,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 17:22:34,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:22:34,511 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-11-21 17:22:34,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:22:34,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:22:34,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:22:34 BasicIcfg [2022-11-21 17:22:34,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:22:34,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:22:34,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:22:34,680 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:22:34,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:22:22" (3/4) ... [2022-11-21 17:22:34,683 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 17:22:34,815 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:22:34,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:22:34,816 INFO L158 Benchmark]: Toolchain (without parser) took 13765.37ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 148.6MB in the beginning and 282.7MB in the end (delta: -134.1MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. [2022-11-21 17:22:34,817 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:22:34,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.66ms. Allocated memory is still 190.8MB. Free memory was 148.1MB in the beginning and 125.4MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 17:22:34,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.70ms. Allocated memory is still 190.8MB. Free memory was 125.4MB in the beginning and 123.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:22:34,818 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 190.8MB. Free memory was 123.0MB in the beginning and 121.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:22:34,818 INFO L158 Benchmark]: RCFGBuilder took 915.24ms. Allocated memory is still 190.8MB. Free memory was 121.3MB in the beginning and 89.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-21 17:22:34,819 INFO L158 Benchmark]: TraceAbstraction took 11961.17ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 88.9MB in the beginning and 110.8MB in the end (delta: -21.9MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2022-11-21 17:22:34,819 INFO L158 Benchmark]: Witness Printer took 135.87ms. Allocated memory is still 333.4MB. Free memory was 110.8MB in the beginning and 282.7MB in the end (delta: -172.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 17:22:34,821 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.28ms. Allocated memory is still 130.0MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.66ms. Allocated memory is still 190.8MB. Free memory was 148.1MB in the beginning and 125.4MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.70ms. Allocated memory is still 190.8MB. Free memory was 125.4MB in the beginning and 123.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 190.8MB. Free memory was 123.0MB in the beginning and 121.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 915.24ms. Allocated memory is still 190.8MB. Free memory was 121.3MB in the beginning and 89.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11961.17ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 88.9MB in the beginning and 110.8MB in the end (delta: -21.9MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. * Witness Printer took 135.87ms. Allocated memory is still 333.4MB. Free memory was 110.8MB in the beginning and 282.7MB in the end (delta: -172.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L729] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L730] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L731] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L732] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L733] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L734] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}] [L735] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L736] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L737] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L738] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L740] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L836] 0 pthread_t t412; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t412={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t412, ((void *)0), P0, ((void *)0))=-2, t412={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] [L838] 0 pthread_t t413; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t412={5:0}, t413={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t413, ((void *)0), P1, ((void *)0))=-1, t412={5:0}, t413={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] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t414; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t414, ((void *)0), P2, ((void *)0))=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 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) [L815] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] 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 [L817] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L848] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 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 [L850] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 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 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L854] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=49, weak$$choice2=255, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 841]: 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: 839]: 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: 837]: 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, 144 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: 11.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 453 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 91 mSDtfsCounter, 1099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=9, InterpolantAutomatonStates: 81, 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.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 827 NumberOfCodeBlocks, 827 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 727 ConstructedInterpolants, 0 QuantifiedInterpolants, 3445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11-21 17:22:34,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98cd7951-e0a7-463c-979a-d4102370cc8a/bin/uautomizer-vX5HgA9Q3a/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