./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro --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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- 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-8393723 [2022-11-18 20:59:22,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:59:22,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:59:22,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:59:22,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:59:22,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:59:22,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:59:22,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:59:22,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:59:22,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:59:22,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:59:22,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:59:22,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:59:22,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:59:22,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:59:22,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:59:22,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:59:22,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:59:22,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:59:22,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:59:22,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:59:22,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:59:22,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:59:22,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:59:22,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:59:22,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:59:22,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:59:22,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:59:22,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:59:22,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:59:22,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:59:22,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:59:22,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:59:22,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:59:22,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:59:22,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:59:22,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:59:22,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:59:22,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:59:22,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:59:22,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:59:22,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:59:22,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:59:22,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:59:22,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:59:22,776 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:59:22,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:59:22,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:59:22,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:59:22,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:59:22,778 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:59:22,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:59:22,778 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:59:22,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:59:22,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:59:22,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:59:22,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:59:22,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:59:22,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:59:22,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:59:22,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:59:22,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:59:22,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:59:22,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:59:22,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:59:22,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:59:22,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:59:22,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:59:22,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:59:22,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:59:22,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:59:22,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:59:22,784 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:59:22,784 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:59:22,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:59:22,784 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_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/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_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2022-11-18 20:59:23,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:59:23,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:59:23,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:59:23,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:59:23,159 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:59:23,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2022-11-18 20:59:23,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/data/dcc763256/b4c9b10b5545453091bad0165691b57e/FLAG56feed280 [2022-11-18 20:59:23,749 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:59:23,755 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2022-11-18 20:59:23,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/data/dcc763256/b4c9b10b5545453091bad0165691b57e/FLAG56feed280 [2022-11-18 20:59:24,061 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/data/dcc763256/b4c9b10b5545453091bad0165691b57e [2022-11-18 20:59:24,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:59:24,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:59:24,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:59:24,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:59:24,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:59:24,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d42e165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24, skipping insertion in model container [2022-11-18 20:59:24,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:59:24,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:59:24,388 WARN L234 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_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2022-11-18 20:59:24,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:59:24,677 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:59:24,700 WARN L234 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_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/sv-benchmarks/c/pthread-wmm/mix037.opt.i[944,957] [2022-11-18 20:59:24,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:59:24,807 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:59:24,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24 WrapperNode [2022-11-18 20:59:24,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:59:24,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:59:24,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:59:24,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:59:24,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,866 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-11-18 20:59:24,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:59:24,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:59:24,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:59:24,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:59:24,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:59:24,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:59:24,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:59:24,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:59:24,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (1/1) ... [2022-11-18 20:59:24,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:59:24,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:59:24,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:59:24,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:59:25,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:59:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:59:25,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:59:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:59:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:59:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:59:25,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:59:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:59:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:59:25,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:59:25,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:59:25,016 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:59:25,235 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:59:25,237 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:59:25,686 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:59:25,961 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:59:25,961 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:59:25,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:59:25 BoogieIcfgContainer [2022-11-18 20:59:25,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:59:25,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:59:25,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:59:25,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:59:25,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:59:24" (1/3) ... [2022-11-18 20:59:25,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c98ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:59:25, skipping insertion in model container [2022-11-18 20:59:25,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:59:24" (2/3) ... [2022-11-18 20:59:25,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c98ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:59:25, skipping insertion in model container [2022-11-18 20:59:25,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:59:25" (3/3) ... [2022-11-18 20:59:25,981 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2022-11-18 20:59:25,993 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:59:26,007 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:59:26,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:59:26,008 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:59:26,140 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:59:26,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 20:59:26,260 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-18 20:59:26,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:59:26,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-18 20:59:26,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 20:59:26,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-18 20:59:26,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:59:26,291 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;@6542ca58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:59:26,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 20:59:26,317 INFO L130 PetriNetUnfolder]: 0/91 cut-off events. [2022-11-18 20:59:26,317 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:59:26,318 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:26,318 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] [2022-11-18 20:59:26,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1958920317, now seen corresponding path program 1 times [2022-11-18 20:59:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831837138] [2022-11-18 20:59:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:27,246 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-18 20:59:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:27,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831837138] [2022-11-18 20:59:27,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831837138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:27,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:27,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:59:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113356743] [2022-11-18 20:59:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:27,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:59:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:59:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:59:27,321 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 137 [2022-11-18 20:59:27,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:27,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:27,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 137 [2022-11-18 20:59:27,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:27,543 INFO L130 PetriNetUnfolder]: 10/207 cut-off events. [2022-11-18 20:59:27,544 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 20:59:27,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 207 events. 10/207 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 385 event pairs, 4 based on Foata normal form. 6/204 useless extension candidates. Maximal degree in co-relation 191. Up to 17 conditions per place. [2022-11-18 20:59:27,548 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 9 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2022-11-18 20:59:27,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 131 transitions, 296 flow [2022-11-18 20:59:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:59:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:59:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-18 20:59:27,575 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-11-18 20:59:27,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-18 20:59:27,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-18 20:59:27,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:27,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-18 20:59:27,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-18 20:59:27,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-18 20:59:27,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-18 20:59:27,609 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-11-18 20:59:27,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 131 transitions, 296 flow [2022-11-18 20:59:27,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 131 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:59:27,630 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-18 20:59:27,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-18 20:59:27,639 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-18 20:59:27,640 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-18 20:59:27,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:27,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:27,642 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] [2022-11-18 20:59:27,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:59:27,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 519742076, now seen corresponding path program 1 times [2022-11-18 20:59:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:27,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687352439] [2022-11-18 20:59:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:27,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:28,396 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-18 20:59:28,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:28,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687352439] [2022-11-18 20:59:28,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687352439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:28,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:28,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:59:28,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221234753] [2022-11-18 20:59:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:28,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:59:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:28,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:59:28,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:59:28,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-11-18 20:59:28,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:28,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:28,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-11-18 20:59:28,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:30,096 INFO L130 PetriNetUnfolder]: 1866/4780 cut-off events. [2022-11-18 20:59:30,096 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-18 20:59:30,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7672 conditions, 4780 events. 1866/4780 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 41293 event pairs, 253 based on Foata normal form. 0/4669 useless extension candidates. Maximal degree in co-relation 7610. Up to 1025 conditions per place. [2022-11-18 20:59:30,135 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 32 selfloop transitions, 7 changer transitions 80/210 dead transitions. [2022-11-18 20:59:30,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 210 transitions, 650 flow [2022-11-18 20:59:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:59:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:59:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1513 transitions. [2022-11-18 20:59:30,142 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8495227400336889 [2022-11-18 20:59:30,142 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1513 transitions. [2022-11-18 20:59:30,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1513 transitions. [2022-11-18 20:59:30,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:30,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1513 transitions. [2022-11-18 20:59:30,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.38461538461539) internal successors, (1513), 13 states have internal predecessors, (1513), 0 states have call successors, (0), 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-18 20:59:30,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:59:30,152 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:59:30,152 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1513 transitions. [2022-11-18 20:59:30,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 210 transitions, 650 flow [2022-11-18 20:59:30,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 210 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:59:30,157 INFO L231 Difference]: Finished difference. Result has 162 places, 120 transitions, 338 flow [2022-11-18 20:59:30,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=338, PETRI_PLACES=162, PETRI_TRANSITIONS=120} [2022-11-18 20:59:30,158 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-11-18 20:59:30,158 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 120 transitions, 338 flow [2022-11-18 20:59:30,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:30,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:30,159 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-18 20:59:30,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:59:30,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:30,161 INFO L85 PathProgramCache]: Analyzing trace with hash 828080441, now seen corresponding path program 1 times [2022-11-18 20:59:30,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:30,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340041589] [2022-11-18 20:59:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:30,604 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-18 20:59:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:30,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340041589] [2022-11-18 20:59:30,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340041589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:30,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:30,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:59:30,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561233765] [2022-11-18 20:59:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:30,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:59:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:59:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:59:30,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-11-18 20:59:30,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 120 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 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-18 20:59:30,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:30,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-11-18 20:59:30,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:31,870 INFO L130 PetriNetUnfolder]: 1171/2594 cut-off events. [2022-11-18 20:59:31,870 INFO L131 PetriNetUnfolder]: For 6223/6239 co-relation queries the response was YES. [2022-11-18 20:59:31,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8768 conditions, 2594 events. 1171/2594 cut-off events. For 6223/6239 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18160 event pairs, 228 based on Foata normal form. 53/2575 useless extension candidates. Maximal degree in co-relation 8694. Up to 906 conditions per place. [2022-11-18 20:59:31,904 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 39 selfloop transitions, 15 changer transitions 58/203 dead transitions. [2022-11-18 20:59:31,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 1104 flow [2022-11-18 20:59:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:59:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:59:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1514 transitions. [2022-11-18 20:59:31,911 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8500842223469961 [2022-11-18 20:59:31,911 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1514 transitions. [2022-11-18 20:59:31,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1514 transitions. [2022-11-18 20:59:31,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:31,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1514 transitions. [2022-11-18 20:59:31,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.46153846153847) internal successors, (1514), 13 states have internal predecessors, (1514), 0 states have call successors, (0), 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-18 20:59:31,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:59:31,923 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:59:31,924 INFO L175 Difference]: Start difference. First operand has 162 places, 120 transitions, 338 flow. Second operand 13 states and 1514 transitions. [2022-11-18 20:59:31,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 1104 flow [2022-11-18 20:59:31,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 203 transitions, 1052 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-18 20:59:31,960 INFO L231 Difference]: Finished difference. Result has 158 places, 127 transitions, 461 flow [2022-11-18 20:59:31,961 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=461, PETRI_PLACES=158, PETRI_TRANSITIONS=127} [2022-11-18 20:59:31,964 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 14 predicate places. [2022-11-18 20:59:31,964 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 127 transitions, 461 flow [2022-11-18 20:59:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 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-18 20:59:31,965 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:31,965 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, 1, 1] [2022-11-18 20:59:31,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:59:31,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1966498392, now seen corresponding path program 1 times [2022-11-18 20:59:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:31,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281606103] [2022-11-18 20:59:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:32,439 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-18 20:59:32,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:32,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281606103] [2022-11-18 20:59:32,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281606103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:32,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:32,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:59:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335882178] [2022-11-18 20:59:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:32,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:59:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:59:32,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:59:32,451 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-11-18 20:59:32,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 127 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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-18 20:59:32,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:32,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-11-18 20:59:32,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:35,680 INFO L130 PetriNetUnfolder]: 6565/11795 cut-off events. [2022-11-18 20:59:35,680 INFO L131 PetriNetUnfolder]: For 22168/28281 co-relation queries the response was YES. [2022-11-18 20:59:35,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31746 conditions, 11795 events. 6565/11795 cut-off events. For 22168/28281 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 101606 event pairs, 610 based on Foata normal form. 67/10706 useless extension candidates. Maximal degree in co-relation 31665. Up to 3767 conditions per place. [2022-11-18 20:59:35,847 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 63 selfloop transitions, 18 changer transitions 16/202 dead transitions. [2022-11-18 20:59:35,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 202 transitions, 1007 flow [2022-11-18 20:59:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:59:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:59:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1213 transitions. [2022-11-18 20:59:35,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8854014598540146 [2022-11-18 20:59:35,853 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1213 transitions. [2022-11-18 20:59:35,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1213 transitions. [2022-11-18 20:59:35,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:35,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1213 transitions. [2022-11-18 20:59:35,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.3) internal successors, (1213), 10 states have internal predecessors, (1213), 0 states have call successors, (0), 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-18 20:59:35,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 20:59:35,862 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 20:59:35,862 INFO L175 Difference]: Start difference. First operand has 158 places, 127 transitions, 461 flow. Second operand 10 states and 1213 transitions. [2022-11-18 20:59:35,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 202 transitions, 1007 flow [2022-11-18 20:59:35,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 202 transitions, 977 flow, removed 15 selfloop flow, removed 12 redundant places. [2022-11-18 20:59:35,948 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 563 flow [2022-11-18 20:59:35,949 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=563, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2022-11-18 20:59:35,949 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 8 predicate places. [2022-11-18 20:59:35,950 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 563 flow [2022-11-18 20:59:35,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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-18 20:59:35,951 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:35,951 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, 1, 1, 1, 1] [2022-11-18 20:59:35,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:59:35,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1980516937, now seen corresponding path program 1 times [2022-11-18 20:59:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:35,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804722077] [2022-11-18 20:59:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:36,442 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-18 20:59:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:36,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804722077] [2022-11-18 20:59:36,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804722077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:36,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:36,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:59:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133968197] [2022-11-18 20:59:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:36,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:59:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:59:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:59:36,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-11-18 20:59:36,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 563 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 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-18 20:59:36,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:36,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-11-18 20:59:36,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:38,605 INFO L130 PetriNetUnfolder]: 2148/6455 cut-off events. [2022-11-18 20:59:38,605 INFO L131 PetriNetUnfolder]: For 13142/14837 co-relation queries the response was YES. [2022-11-18 20:59:38,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19889 conditions, 6455 events. 2148/6455 cut-off events. For 13142/14837 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 66733 event pairs, 796 based on Foata normal form. 128/6066 useless extension candidates. Maximal degree in co-relation 19807. Up to 1445 conditions per place. [2022-11-18 20:59:38,692 INFO L137 encePairwiseOnDemand]: 128/137 looper letters, 67 selfloop transitions, 20 changer transitions 4/198 dead transitions. [2022-11-18 20:59:38,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 198 transitions, 1148 flow [2022-11-18 20:59:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:59:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:59:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1162 transitions. [2022-11-18 20:59:38,696 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8481751824817518 [2022-11-18 20:59:38,696 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1162 transitions. [2022-11-18 20:59:38,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1162 transitions. [2022-11-18 20:59:38,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:38,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1162 transitions. [2022-11-18 20:59:38,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.2) internal successors, (1162), 10 states have internal predecessors, (1162), 0 states have call successors, (0), 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-18 20:59:38,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 20:59:38,704 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-18 20:59:38,705 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 563 flow. Second operand 10 states and 1162 transitions. [2022-11-18 20:59:38,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 198 transitions, 1148 flow [2022-11-18 20:59:38,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 198 transitions, 1146 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:59:38,743 INFO L231 Difference]: Finished difference. Result has 168 places, 154 transitions, 737 flow [2022-11-18 20:59:38,743 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=737, PETRI_PLACES=168, PETRI_TRANSITIONS=154} [2022-11-18 20:59:38,744 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 24 predicate places. [2022-11-18 20:59:38,744 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 154 transitions, 737 flow [2022-11-18 20:59:38,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 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-18 20:59:38,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:38,746 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, 1, 1, 1, 1] [2022-11-18 20:59:38,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:59:38,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1504126775, now seen corresponding path program 1 times [2022-11-18 20:59:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:38,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821595241] [2022-11-18 20:59:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:39,150 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-18 20:59:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821595241] [2022-11-18 20:59:39,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821595241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:39,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:39,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:59:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513662598] [2022-11-18 20:59:39,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:39,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:59:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:59:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:59:39,156 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-11-18 20:59:39,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 154 transitions, 737 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 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-18 20:59:39,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:39,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-11-18 20:59:39,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:43,033 INFO L130 PetriNetUnfolder]: 8096/15618 cut-off events. [2022-11-18 20:59:43,034 INFO L131 PetriNetUnfolder]: For 54533/61268 co-relation queries the response was YES. [2022-11-18 20:59:43,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58063 conditions, 15618 events. 8096/15618 cut-off events. For 54533/61268 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 150745 event pairs, 345 based on Foata normal form. 670/15591 useless extension candidates. Maximal degree in co-relation 57976. Up to 4747 conditions per place. [2022-11-18 20:59:43,212 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 96 selfloop transitions, 34 changer transitions 8/253 dead transitions. [2022-11-18 20:59:43,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 253 transitions, 1743 flow [2022-11-18 20:59:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:59:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:59:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1578 transitions. [2022-11-18 20:59:43,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8860190903986525 [2022-11-18 20:59:43,219 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1578 transitions. [2022-11-18 20:59:43,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1578 transitions. [2022-11-18 20:59:43,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:43,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1578 transitions. [2022-11-18 20:59:43,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.38461538461539) internal successors, (1578), 13 states have internal predecessors, (1578), 0 states have call successors, (0), 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-18 20:59:43,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:59:43,231 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 20:59:43,231 INFO L175 Difference]: Start difference. First operand has 168 places, 154 transitions, 737 flow. Second operand 13 states and 1578 transitions. [2022-11-18 20:59:43,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 253 transitions, 1743 flow [2022-11-18 20:59:43,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 253 transitions, 1701 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-11-18 20:59:43,545 INFO L231 Difference]: Finished difference. Result has 186 places, 172 transitions, 981 flow [2022-11-18 20:59:43,545 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=981, PETRI_PLACES=186, PETRI_TRANSITIONS=172} [2022-11-18 20:59:43,546 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 42 predicate places. [2022-11-18 20:59:43,547 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 172 transitions, 981 flow [2022-11-18 20:59:43,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 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-18 20:59:43,547 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:43,548 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:43,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:59:43,548 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -823488095, now seen corresponding path program 1 times [2022-11-18 20:59:43,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:43,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146178926] [2022-11-18 20:59:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:44,083 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-18 20:59:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:44,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146178926] [2022-11-18 20:59:44,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146178926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:44,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:44,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:59:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656433675] [2022-11-18 20:59:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:44,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:59:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:44,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:59:44,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:59:44,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-11-18 20:59:44,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 172 transitions, 981 flow. Second operand has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-18 20:59:44,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:44,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-11-18 20:59:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:47,543 INFO L130 PetriNetUnfolder]: 7488/14879 cut-off events. [2022-11-18 20:59:47,543 INFO L131 PetriNetUnfolder]: For 86487/93629 co-relation queries the response was YES. [2022-11-18 20:59:47,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68073 conditions, 14879 events. 7488/14879 cut-off events. For 86487/93629 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 147823 event pairs, 227 based on Foata normal form. 841/15090 useless extension candidates. Maximal degree in co-relation 67977. Up to 4498 conditions per place. [2022-11-18 20:59:47,697 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 89 selfloop transitions, 52 changer transitions 40/288 dead transitions. [2022-11-18 20:59:47,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 288 transitions, 2326 flow [2022-11-18 20:59:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:59:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:59:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1942 transitions. [2022-11-18 20:59:47,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8859489051094891 [2022-11-18 20:59:47,705 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1942 transitions. [2022-11-18 20:59:47,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1942 transitions. [2022-11-18 20:59:47,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:47,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1942 transitions. [2022-11-18 20:59:47,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.375) internal successors, (1942), 16 states have internal predecessors, (1942), 0 states have call successors, (0), 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-18 20:59:47,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-18 20:59:47,722 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-18 20:59:47,723 INFO L175 Difference]: Start difference. First operand has 186 places, 172 transitions, 981 flow. Second operand 16 states and 1942 transitions. [2022-11-18 20:59:47,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 288 transitions, 2326 flow [2022-11-18 20:59:50,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 288 transitions, 2219 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-11-18 20:59:50,228 INFO L231 Difference]: Finished difference. Result has 200 places, 188 transitions, 1229 flow [2022-11-18 20:59:50,228 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1229, PETRI_PLACES=200, PETRI_TRANSITIONS=188} [2022-11-18 20:59:50,229 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 56 predicate places. [2022-11-18 20:59:50,229 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 188 transitions, 1229 flow [2022-11-18 20:59:50,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 0 states have call successors, (0), 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-18 20:59:50,230 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:50,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:50,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:59:50,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1413198385, now seen corresponding path program 1 times [2022-11-18 20:59:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:50,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286074828] [2022-11-18 20:59:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:50,563 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-18 20:59:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:50,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286074828] [2022-11-18 20:59:50,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286074828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:50,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:50,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:59:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333894728] [2022-11-18 20:59:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:50,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:59:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:59:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:59:50,567 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 20:59:50,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 188 transitions, 1229 flow. Second operand has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 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-18 20:59:50,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:50,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 20:59:50,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:52,671 INFO L130 PetriNetUnfolder]: 2886/9801 cut-off events. [2022-11-18 20:59:52,672 INFO L131 PetriNetUnfolder]: For 49816/52447 co-relation queries the response was YES. [2022-11-18 20:59:52,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37802 conditions, 9801 events. 2886/9801 cut-off events. For 49816/52447 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 123048 event pairs, 82 based on Foata normal form. 17/9197 useless extension candidates. Maximal degree in co-relation 37697. Up to 2395 conditions per place. [2022-11-18 20:59:52,791 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 55 selfloop transitions, 23 changer transitions 20/245 dead transitions. [2022-11-18 20:59:52,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 245 transitions, 1855 flow [2022-11-18 20:59:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:59:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:59:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1251 transitions. [2022-11-18 20:59:52,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8301260783012607 [2022-11-18 20:59:52,798 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1251 transitions. [2022-11-18 20:59:52,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1251 transitions. [2022-11-18 20:59:52,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:52,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1251 transitions. [2022-11-18 20:59:52,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.72727272727273) internal successors, (1251), 11 states have internal predecessors, (1251), 0 states have call successors, (0), 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-18 20:59:52,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 20:59:52,809 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 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-18 20:59:52,810 INFO L175 Difference]: Start difference. First operand has 200 places, 188 transitions, 1229 flow. Second operand 11 states and 1251 transitions. [2022-11-18 20:59:52,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 245 transitions, 1855 flow [2022-11-18 20:59:55,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 245 transitions, 1502 flow, removed 140 selfloop flow, removed 17 redundant places. [2022-11-18 20:59:55,197 INFO L231 Difference]: Finished difference. Result has 195 places, 198 transitions, 1143 flow [2022-11-18 20:59:55,198 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1143, PETRI_PLACES=195, PETRI_TRANSITIONS=198} [2022-11-18 20:59:55,199 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 51 predicate places. [2022-11-18 20:59:55,199 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 198 transitions, 1143 flow [2022-11-18 20:59:55,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 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-18 20:59:55,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:55,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:59:55,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 821306941, now seen corresponding path program 2 times [2022-11-18 20:59:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508973256] [2022-11-18 20:59:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:55,532 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-18 20:59:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508973256] [2022-11-18 20:59:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508973256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:55,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:59:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337227679] [2022-11-18 20:59:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:55,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:59:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:55,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:59:55,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:59:55,535 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 20:59:55,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 198 transitions, 1143 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 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-18 20:59:55,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:55,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 20:59:55,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:57,383 INFO L130 PetriNetUnfolder]: 3677/12092 cut-off events. [2022-11-18 20:59:57,383 INFO L131 PetriNetUnfolder]: For 22962/23297 co-relation queries the response was YES. [2022-11-18 20:59:57,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33842 conditions, 12092 events. 3677/12092 cut-off events. For 22962/23297 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 157651 event pairs, 85 based on Foata normal form. 12/11479 useless extension candidates. Maximal degree in co-relation 33739. Up to 1304 conditions per place. [2022-11-18 20:59:57,788 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 70 selfloop transitions, 19 changer transitions 20/256 dead transitions. [2022-11-18 20:59:57,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 256 transitions, 1919 flow [2022-11-18 20:59:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:59:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:59:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2022-11-18 20:59:57,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8475263584752636 [2022-11-18 20:59:57,793 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2022-11-18 20:59:57,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2022-11-18 20:59:57,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:57,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2022-11-18 20:59:57,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 0 states have call successors, (0), 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-18 20:59:57,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 20:59:57,800 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 20:59:57,800 INFO L175 Difference]: Start difference. First operand has 195 places, 198 transitions, 1143 flow. Second operand 9 states and 1045 transitions. [2022-11-18 20:59:57,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 256 transitions, 1919 flow [2022-11-18 20:59:58,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 256 transitions, 1791 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-11-18 20:59:58,695 INFO L231 Difference]: Finished difference. Result has 197 places, 200 transitions, 1237 flow [2022-11-18 20:59:58,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1237, PETRI_PLACES=197, PETRI_TRANSITIONS=200} [2022-11-18 20:59:58,696 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2022-11-18 20:59:58,696 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 200 transitions, 1237 flow [2022-11-18 20:59:58,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 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-18 20:59:58,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:58,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:58,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:59:58,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 20:59:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1846520407, now seen corresponding path program 3 times [2022-11-18 20:59:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049287165] [2022-11-18 20:59:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:59,044 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-18 20:59:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:59,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049287165] [2022-11-18 20:59:59,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049287165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:59,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:59,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:59:59,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609727442] [2022-11-18 20:59:59,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:59,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:59:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:59,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:59:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:59:59,048 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-11-18 20:59:59,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 200 transitions, 1237 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 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-18 20:59:59,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:59,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-11-18 20:59:59,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:00:04,502 INFO L130 PetriNetUnfolder]: 12581/26028 cut-off events. [2022-11-18 21:00:04,502 INFO L131 PetriNetUnfolder]: For 104901/114889 co-relation queries the response was YES. [2022-11-18 21:00:04,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98333 conditions, 26028 events. 12581/26028 cut-off events. For 104901/114889 co-relation queries the response was YES. Maximal size of possible extension queue 2391. Compared 290241 event pairs, 395 based on Foata normal form. 1441/26445 useless extension candidates. Maximal degree in co-relation 98294. Up to 3356 conditions per place. [2022-11-18 21:00:04,724 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 49 selfloop transitions, 43 changer transitions 123/313 dead transitions. [2022-11-18 21:00:04,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 313 transitions, 2795 flow [2022-11-18 21:00:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 21:00:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 21:00:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2272 transitions. [2022-11-18 21:00:04,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8728390318862851 [2022-11-18 21:00:04,732 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2272 transitions. [2022-11-18 21:00:04,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2272 transitions. [2022-11-18 21:00:04,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:00:04,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2272 transitions. [2022-11-18 21:00:04,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.57894736842105) internal successors, (2272), 19 states have internal predecessors, (2272), 0 states have call successors, (0), 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-18 21:00:04,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-18 21:00:04,746 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-18 21:00:04,747 INFO L175 Difference]: Start difference. First operand has 197 places, 200 transitions, 1237 flow. Second operand 19 states and 2272 transitions. [2022-11-18 21:00:04,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 313 transitions, 2795 flow [2022-11-18 21:00:08,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 313 transitions, 2630 flow, removed 73 selfloop flow, removed 6 redundant places. [2022-11-18 21:00:08,276 INFO L231 Difference]: Finished difference. Result has 213 places, 162 transitions, 878 flow [2022-11-18 21:00:08,277 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=878, PETRI_PLACES=213, PETRI_TRANSITIONS=162} [2022-11-18 21:00:08,277 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 69 predicate places. [2022-11-18 21:00:08,278 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 162 transitions, 878 flow [2022-11-18 21:00:08,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 0 states have call successors, (0), 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-18 21:00:08,278 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:00:08,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:08,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:00:08,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:00:08,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1012323643, now seen corresponding path program 1 times [2022-11-18 21:00:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:00:08,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195676021] [2022-11-18 21:00:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:00:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:09,581 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-18 21:00:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:00:09,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195676021] [2022-11-18 21:00:09,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195676021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:00:09,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:00:09,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 21:00:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662044814] [2022-11-18 21:00:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:00:09,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 21:00:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:00:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 21:00:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-18 21:00:09,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 137 [2022-11-18 21:00:09,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 162 transitions, 878 flow. Second operand has 12 states, 12 states have (on average 103.58333333333333) internal successors, (1243), 12 states have internal predecessors, (1243), 0 states have call successors, (0), 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-18 21:00:09,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:00:09,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 137 [2022-11-18 21:00:09,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:00:10,618 INFO L130 PetriNetUnfolder]: 849/3730 cut-off events. [2022-11-18 21:00:10,618 INFO L131 PetriNetUnfolder]: For 8572/8804 co-relation queries the response was YES. [2022-11-18 21:00:10,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11825 conditions, 3730 events. 849/3730 cut-off events. For 8572/8804 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 43679 event pairs, 13 based on Foata normal form. 1/3559 useless extension candidates. Maximal degree in co-relation 11759. Up to 447 conditions per place. [2022-11-18 21:00:10,658 INFO L137 encePairwiseOnDemand]: 121/137 looper letters, 36 selfloop transitions, 28 changer transitions 11/201 dead transitions. [2022-11-18 21:00:10,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 201 transitions, 1437 flow [2022-11-18 21:00:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:00:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 21:00:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1381 transitions. [2022-11-18 21:00:10,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7754070746771476 [2022-11-18 21:00:10,662 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1381 transitions. [2022-11-18 21:00:10,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1381 transitions. [2022-11-18 21:00:10,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:00:10,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1381 transitions. [2022-11-18 21:00:10,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.23076923076923) internal successors, (1381), 13 states have internal predecessors, (1381), 0 states have call successors, (0), 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-18 21:00:10,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 21:00:10,673 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-18 21:00:10,673 INFO L175 Difference]: Start difference. First operand has 213 places, 162 transitions, 878 flow. Second operand 13 states and 1381 transitions. [2022-11-18 21:00:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 201 transitions, 1437 flow [2022-11-18 21:00:10,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 201 transitions, 1067 flow, removed 90 selfloop flow, removed 31 redundant places. [2022-11-18 21:00:10,808 INFO L231 Difference]: Finished difference. Result has 192 places, 180 transitions, 925 flow [2022-11-18 21:00:10,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=925, PETRI_PLACES=192, PETRI_TRANSITIONS=180} [2022-11-18 21:00:10,809 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 48 predicate places. [2022-11-18 21:00:10,809 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 180 transitions, 925 flow [2022-11-18 21:00:10,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 103.58333333333333) internal successors, (1243), 12 states have internal predecessors, (1243), 0 states have call successors, (0), 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-18 21:00:10,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:00:10,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:10,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:00:10,812 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:00:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1458322163, now seen corresponding path program 2 times [2022-11-18 21:00:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:00:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112542153] [2022-11-18 21:00:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:00:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:11,213 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-18 21:00:11,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:00:11,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112542153] [2022-11-18 21:00:11,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112542153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:00:11,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:00:11,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:00:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253808141] [2022-11-18 21:00:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:00:11,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:00:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:00:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:00:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:00:11,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 21:00:11,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 180 transitions, 925 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 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-18 21:00:11,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:00:11,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 21:00:11,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:00:12,131 INFO L130 PetriNetUnfolder]: 1036/4547 cut-off events. [2022-11-18 21:00:12,132 INFO L131 PetriNetUnfolder]: For 6033/6144 co-relation queries the response was YES. [2022-11-18 21:00:12,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12077 conditions, 4547 events. 1036/4547 cut-off events. For 6033/6144 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 55395 event pairs, 18 based on Foata normal form. 1/4341 useless extension candidates. Maximal degree in co-relation 12042. Up to 470 conditions per place. [2022-11-18 21:00:12,176 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 32 selfloop transitions, 27 changer transitions 14/204 dead transitions. [2022-11-18 21:00:12,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 204 transitions, 1242 flow [2022-11-18 21:00:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:00:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 21:00:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2022-11-18 21:00:12,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8193430656934306 [2022-11-18 21:00:12,180 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2022-11-18 21:00:12,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2022-11-18 21:00:12,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:00:12,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2022-11-18 21:00:12,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 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-18 21:00:12,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 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-18 21:00:12,187 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 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-18 21:00:12,187 INFO L175 Difference]: Start difference. First operand has 192 places, 180 transitions, 925 flow. Second operand 8 states and 898 transitions. [2022-11-18 21:00:12,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 204 transitions, 1242 flow [2022-11-18 21:00:12,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 204 transitions, 1228 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-18 21:00:12,374 INFO L231 Difference]: Finished difference. Result has 197 places, 184 transitions, 1078 flow [2022-11-18 21:00:12,374 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1078, PETRI_PLACES=197, PETRI_TRANSITIONS=184} [2022-11-18 21:00:12,375 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2022-11-18 21:00:12,375 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 184 transitions, 1078 flow [2022-11-18 21:00:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 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-18 21:00:12,376 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:00:12,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:12,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 21:00:12,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:00:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash -505101657, now seen corresponding path program 3 times [2022-11-18 21:00:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:00:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525391087] [2022-11-18 21:00:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:00:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:00:12,758 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-18 21:00:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:00:12,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525391087] [2022-11-18 21:00:12,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525391087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:00:12,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:00:12,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:00:12,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130431572] [2022-11-18 21:00:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:00:12,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:00:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:00:12,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:00:12,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:00:12,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 21:00:12,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 184 transitions, 1078 flow. Second operand has 8 states, 8 states have (on average 109.25) internal successors, (874), 8 states have internal predecessors, (874), 0 states have call successors, (0), 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-18 21:00:12,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:00:12,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 21:00:12,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:00:13,744 INFO L130 PetriNetUnfolder]: 987/3905 cut-off events. [2022-11-18 21:00:13,744 INFO L131 PetriNetUnfolder]: For 6201/6344 co-relation queries the response was YES. [2022-11-18 21:00:13,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10940 conditions, 3905 events. 987/3905 cut-off events. For 6201/6344 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 45685 event pairs, 7 based on Foata normal form. 1/3701 useless extension candidates. Maximal degree in co-relation 10902. Up to 446 conditions per place. [2022-11-18 21:00:13,797 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 37 selfloop transitions, 24 changer transitions 5/197 dead transitions. [2022-11-18 21:00:13,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 197 transitions, 1274 flow [2022-11-18 21:00:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:00:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:00:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1002 transitions. [2022-11-18 21:00:13,800 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8126520681265207 [2022-11-18 21:00:13,800 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1002 transitions. [2022-11-18 21:00:13,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1002 transitions. [2022-11-18 21:00:13,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:00:13,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1002 transitions. [2022-11-18 21:00:13,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.33333333333333) internal successors, (1002), 9 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-18 21:00:13,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 21:00:13,806 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-18 21:00:13,806 INFO L175 Difference]: Start difference. First operand has 197 places, 184 transitions, 1078 flow. Second operand 9 states and 1002 transitions. [2022-11-18 21:00:13,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 197 transitions, 1274 flow [2022-11-18 21:00:13,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 197 transitions, 1239 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-11-18 21:00:13,947 INFO L231 Difference]: Finished difference. Result has 200 places, 184 transitions, 1108 flow [2022-11-18 21:00:13,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1108, PETRI_PLACES=200, PETRI_TRANSITIONS=184} [2022-11-18 21:00:13,949 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 56 predicate places. [2022-11-18 21:00:13,949 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 184 transitions, 1108 flow [2022-11-18 21:00:13,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.25) internal successors, (874), 8 states have internal predecessors, (874), 0 states have call successors, (0), 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-18 21:00:13,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:00:13,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:13,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 21:00:13,950 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:00:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:00:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1980545805, now seen corresponding path program 4 times [2022-11-18 21:00:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:00:13,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059262996] [2022-11-18 21:00:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:00:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:00:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:00:13,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:00:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:00:14,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:00:14,070 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:00:14,071 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 21:00:14,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 21:00:14,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 21:00:14,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 21:00:14,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 21:00:14,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 21:00:14,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 21:00:14,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 21:00:14,075 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:00:14,081 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:00:14,082 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:00:14,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:00:14 BasicIcfg [2022-11-18 21:00:14,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:00:14,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:00:14,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:00:14,269 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:00:14,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:59:25" (3/4) ... [2022-11-18 21:00:14,273 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 21:00:14,395 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 21:00:14,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:00:14,396 INFO L158 Benchmark]: Toolchain (without parser) took 50330.70ms. Allocated memory was 107.0MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 64.4MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-18 21:00:14,396 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:00:14,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.69ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 70.4MB in the end (delta: -6.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-11-18 21:00:14,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.76ms. Allocated memory is still 107.0MB. Free memory was 70.4MB in the beginning and 67.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:00:14,398 INFO L158 Benchmark]: Boogie Preprocessor took 38.85ms. Allocated memory is still 107.0MB. Free memory was 67.8MB in the beginning and 66.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:00:14,398 INFO L158 Benchmark]: RCFGBuilder took 1059.51ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 66.0MB in the beginning and 102.1MB in the end (delta: -36.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-11-18 21:00:14,399 INFO L158 Benchmark]: TraceAbstraction took 48299.10ms. Allocated memory was 136.3MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 101.4MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-18 21:00:14,399 INFO L158 Benchmark]: Witness Printer took 126.34ms. Allocated memory is still 10.1GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-18 21:00:14,401 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.34ms. Allocated memory is still 107.0MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.69ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 70.4MB in the end (delta: -6.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.76ms. Allocated memory is still 107.0MB. Free memory was 70.4MB in the beginning and 67.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.85ms. Allocated memory is still 107.0MB. Free memory was 67.8MB in the beginning and 66.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1059.51ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 66.0MB in the beginning and 102.1MB in the end (delta: -36.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 48299.10ms. Allocated memory was 136.3MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 101.4MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 126.34ms. Allocated memory is still 10.1GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L742] 0 _Bool z$r_buff1_thd4; VAL [z$r_buff1_thd4=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L749] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L747] 0 int z$w_buff1; VAL [weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L750] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L731] 0 _Bool z$flush_delayed; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff1=0] [L745] 0 int z$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$w_buff0=0, z$w_buff1=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L720] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L722] 0 int b = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 pthread_t t973; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=-3, t973={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t974; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=-2, t973={5:0}, t974={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t975; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=-1, t973={5:0}, t974={6:0}, t975={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t976; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 47.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 982 mSDsluCounter, 1162 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 237 mSDtfsCounter, 1799 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1237occurred in iteration=9, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1361 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1242 ConstructedInterpolants, 0 QuantifiedInterpolants, 5346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 21:00:14,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a11cd16-8f84-4e42-ad10-2fff7e2562a2/bin/uautomizer-TMbwUNV5ro/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