./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/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_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/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_ea8b2efd-d147-4373-a505-9bf1917aad95/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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- 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 19:46:19,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:46:19,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:46:19,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:46:19,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:46:19,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:46:19,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:46:19,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:46:19,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:46:19,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:46:19,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:46:19,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:46:19,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:46:19,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:46:19,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:46:19,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:46:19,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:46:19,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:46:19,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:46:19,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:46:19,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:46:19,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:46:19,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:46:19,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:46:19,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:46:19,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:46:19,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:46:19,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:46:19,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:46:19,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:46:19,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:46:19,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:46:19,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:46:19,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:46:19,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:46:19,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:46:19,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:46:19,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:46:19,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:46:19,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:46:19,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:46:19,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:46:19,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:46:19,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:46:19,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:46:19,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:46:19,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:46:19,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:46:19,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:46:19,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:46:19,876 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:46:19,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:46:19,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:46:19,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:46:19,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:46:19,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:46:19,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:46:19,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:46:19,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:46:19,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:46:19,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:46:19,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:46:19,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:46:19,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:46:19,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:46:19,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:46:19,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:46:19,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:46:19,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:46:19,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:46:19,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:46:19,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:46:19,883 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:46:19,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:46:19,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:46:19,884 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_ea8b2efd-d147-4373-a505-9bf1917aad95/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_ea8b2efd-d147-4373-a505-9bf1917aad95/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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2022-11-18 19:46:20,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:46:20,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:46:20,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:46:20,235 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:46:20,236 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:46:20,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix040.opt.i [2022-11-18 19:46:20,321 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/data/61d3f275b/d823a6dcaa9f4871aaea4202371f2dbb/FLAGb6854d32d [2022-11-18 19:46:20,885 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:46:20,886 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2022-11-18 19:46:20,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/data/61d3f275b/d823a6dcaa9f4871aaea4202371f2dbb/FLAGb6854d32d [2022-11-18 19:46:21,294 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/data/61d3f275b/d823a6dcaa9f4871aaea4202371f2dbb [2022-11-18 19:46:21,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:46:21,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:46:21,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:46:21,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:46:21,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:46:21,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:21,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfbbfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21, skipping insertion in model container [2022-11-18 19:46:21,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:21,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:46:21,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:46:21,579 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_ea8b2efd-d147-4373-a505-9bf1917aad95/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2022-11-18 19:46:21,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:46:21,861 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:46:21,879 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_ea8b2efd-d147-4373-a505-9bf1917aad95/sv-benchmarks/c/pthread-wmm/mix040.opt.i[944,957] [2022-11-18 19:46:21,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:46:21,968 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:46:21,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21 WrapperNode [2022-11-18 19:46:21,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:46:21,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:46:21,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:46:21,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:46:21,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,054 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-11-18 19:46:22,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:46:22,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:46:22,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:46:22,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:46:22,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,080 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:46:22,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:46:22,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:46:22,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:46:22,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (1/1) ... [2022-11-18 19:46:22,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:46:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:46:22,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:46:22,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:46:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:46:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:46:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:46:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:46:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:46:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:46:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:46:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:46:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:46:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 19:46:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 19:46:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 19:46:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 19:46:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:46:22,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:46:22,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:46:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:46:22,188 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 19:46:22,433 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:46:22,435 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:46:22,730 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:46:22,938 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:46:22,938 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:46:22,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:46:22 BoogieIcfgContainer [2022-11-18 19:46:22,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:46:22,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:46:22,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:46:22,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:46:22,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:46:21" (1/3) ... [2022-11-18 19:46:22,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388111b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:46:22, skipping insertion in model container [2022-11-18 19:46:22,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:46:21" (2/3) ... [2022-11-18 19:46:22,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388111b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:46:22, skipping insertion in model container [2022-11-18 19:46:22,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:46:22" (3/3) ... [2022-11-18 19:46:22,951 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2022-11-18 19:46:22,960 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:46:22,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:46:22,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:46:22,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:46:23,034 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:46:23,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-18 19:46:23,138 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-18 19:46:23,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:46:23,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-18 19:46:23,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-18 19:46:23,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-18 19:46:23,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:46:23,167 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;@12c06051, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:46:23,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 19:46:23,194 INFO L130 PetriNetUnfolder]: 0/89 cut-off events. [2022-11-18 19:46:23,194 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:46:23,194 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:23,195 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] [2022-11-18 19:46:23,196 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 19:46:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash 97696729, now seen corresponding path program 1 times [2022-11-18 19:46:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:23,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115916675] [2022-11-18 19:46:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:24,046 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 19:46:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:24,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115916675] [2022-11-18 19:46:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115916675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:24,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:24,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:46:24,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083313638] [2022-11-18 19:46:24,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:24,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:46:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:24,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:46:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:46:24,100 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 136 [2022-11-18 19:46:24,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 19:46:24,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:24,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 136 [2022-11-18 19:46:24,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:24,278 INFO L130 PetriNetUnfolder]: 10/170 cut-off events. [2022-11-18 19:46:24,278 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 19:46:24,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 170 events. 10/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 262 event pairs, 2 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2022-11-18 19:46:24,285 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 9 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2022-11-18 19:46:24,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 130 transitions, 294 flow [2022-11-18 19:46:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:46:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:46:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-11-18 19:46:24,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9436274509803921 [2022-11-18 19:46:24,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-11-18 19:46:24,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-11-18 19:46:24,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:24,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-11-18 19:46:24,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 19:46:24,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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 19:46:24,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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 19:46:24,342 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 385 transitions. [2022-11-18 19:46:24,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 130 transitions, 294 flow [2022-11-18 19:46:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 130 transitions, 290 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 19:46:24,355 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-11-18 19:46:24,358 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-11-18 19:46:24,365 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-11-18 19:46:24,366 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-11-18 19:46:24,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 19:46:24,366 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:24,367 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:24,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:46:24,368 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 19:46:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 366503190, now seen corresponding path program 1 times [2022-11-18 19:46:24,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:24,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553159149] [2022-11-18 19:46:24,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:24,870 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 19:46:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:24,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553159149] [2022-11-18 19:46:24,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553159149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:24,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:24,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:46:24,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230250095] [2022-11-18 19:46:24,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:24,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:24,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:24,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:24,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-18 19:46:24,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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 19:46:24,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:24,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-18 19:46:24,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:26,829 INFO L130 PetriNetUnfolder]: 3270/8009 cut-off events. [2022-11-18 19:46:26,830 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-11-18 19:46:26,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12917 conditions, 8009 events. 3270/8009 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 73928 event pairs, 426 based on Foata normal form. 0/7836 useless extension candidates. Maximal degree in co-relation 12856. Up to 1498 conditions per place. [2022-11-18 19:46:26,930 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 35 selfloop transitions, 8 changer transitions 92/224 dead transitions. [2022-11-18 19:46:26,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 224 transitions, 710 flow [2022-11-18 19:46:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:46:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:46:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1503 transitions. [2022-11-18 19:46:26,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8501131221719457 [2022-11-18 19:46:26,936 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1503 transitions. [2022-11-18 19:46:26,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1503 transitions. [2022-11-18 19:46:26,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:26,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1503 transitions. [2022-11-18 19:46:26,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.61538461538461) internal successors, (1503), 13 states have internal predecessors, (1503), 0 states have call successors, (0), 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 19:46:26,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:26,948 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:26,948 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 13 states and 1503 transitions. [2022-11-18 19:46:26,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 224 transitions, 710 flow [2022-11-18 19:46:26,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 224 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:46:26,954 INFO L231 Difference]: Finished difference. Result has 161 places, 120 transitions, 350 flow [2022-11-18 19:46:26,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=350, PETRI_PLACES=161, PETRI_TRANSITIONS=120} [2022-11-18 19:46:26,956 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 18 predicate places. [2022-11-18 19:46:26,956 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 120 transitions, 350 flow [2022-11-18 19:46:26,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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 19:46:26,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:26,957 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] [2022-11-18 19:46:26,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:46:26,958 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 19:46:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 737299577, now seen corresponding path program 1 times [2022-11-18 19:46:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:26,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343640558] [2022-11-18 19:46:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:26,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:27,373 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 19:46:27,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:27,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343640558] [2022-11-18 19:46:27,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343640558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:27,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:27,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:46:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904613807] [2022-11-18 19:46:27,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:27,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:27,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:27,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:27,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-18 19:46:27,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 120 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 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 19:46:27,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:27,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-18 19:46:27,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:28,753 INFO L130 PetriNetUnfolder]: 2063/4583 cut-off events. [2022-11-18 19:46:28,753 INFO L131 PetriNetUnfolder]: For 10895/10895 co-relation queries the response was YES. [2022-11-18 19:46:28,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15044 conditions, 4583 events. 2063/4583 cut-off events. For 10895/10895 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 36000 event pairs, 388 based on Foata normal form. 88/4518 useless extension candidates. Maximal degree in co-relation 14971. Up to 1263 conditions per place. [2022-11-18 19:46:28,807 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 43 selfloop transitions, 18 changer transitions 82/232 dead transitions. [2022-11-18 19:46:28,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 232 transitions, 1404 flow [2022-11-18 19:46:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:46:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:46:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1502 transitions. [2022-11-18 19:46:28,813 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8495475113122172 [2022-11-18 19:46:28,813 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1502 transitions. [2022-11-18 19:46:28,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1502 transitions. [2022-11-18 19:46:28,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:28,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1502 transitions. [2022-11-18 19:46:28,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.53846153846153) internal successors, (1502), 13 states have internal predecessors, (1502), 0 states have call successors, (0), 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 19:46:28,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:28,824 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:28,824 INFO L175 Difference]: Start difference. First operand has 161 places, 120 transitions, 350 flow. Second operand 13 states and 1502 transitions. [2022-11-18 19:46:28,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 232 transitions, 1404 flow [2022-11-18 19:46:28,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 232 transitions, 1376 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-18 19:46:28,864 INFO L231 Difference]: Finished difference. Result has 158 places, 133 transitions, 575 flow [2022-11-18 19:46:28,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=575, PETRI_PLACES=158, PETRI_TRANSITIONS=133} [2022-11-18 19:46:28,867 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 15 predicate places. [2022-11-18 19:46:28,867 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 133 transitions, 575 flow [2022-11-18 19:46:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 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 19:46:28,868 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:28,869 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] [2022-11-18 19:46:28,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:46:28,869 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 19:46:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 641659860, now seen corresponding path program 1 times [2022-11-18 19:46:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367150718] [2022-11-18 19:46:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:29,264 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 19:46:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:29,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367150718] [2022-11-18 19:46:29,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367150718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:29,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:29,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:46:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015682364] [2022-11-18 19:46:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:29,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:29,269 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-18 19:46:29,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 133 transitions, 575 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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 19:46:29,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:29,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-18 19:46:29,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:30,535 INFO L130 PetriNetUnfolder]: 1615/3711 cut-off events. [2022-11-18 19:46:30,535 INFO L131 PetriNetUnfolder]: For 17276/17300 co-relation queries the response was YES. [2022-11-18 19:46:30,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14884 conditions, 3711 events. 1615/3711 cut-off events. For 17276/17300 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 28378 event pairs, 331 based on Foata normal form. 69/3644 useless extension candidates. Maximal degree in co-relation 14799. Up to 1052 conditions per place. [2022-11-18 19:46:30,592 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 44 selfloop transitions, 29 changer transitions 61/223 dead transitions. [2022-11-18 19:46:30,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 223 transitions, 1637 flow [2022-11-18 19:46:30,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:46:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:46:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1495 transitions. [2022-11-18 19:46:30,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8455882352941176 [2022-11-18 19:46:30,598 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1495 transitions. [2022-11-18 19:46:30,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1495 transitions. [2022-11-18 19:46:30,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:30,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1495 transitions. [2022-11-18 19:46:30,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 0 states have call successors, (0), 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 19:46:30,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:30,608 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:30,608 INFO L175 Difference]: Start difference. First operand has 158 places, 133 transitions, 575 flow. Second operand 13 states and 1495 transitions. [2022-11-18 19:46:30,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 223 transitions, 1637 flow [2022-11-18 19:46:30,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 223 transitions, 1565 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-11-18 19:46:30,670 INFO L231 Difference]: Finished difference. Result has 170 places, 143 transitions, 824 flow [2022-11-18 19:46:30,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=824, PETRI_PLACES=170, PETRI_TRANSITIONS=143} [2022-11-18 19:46:30,672 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 27 predicate places. [2022-11-18 19:46:30,672 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 143 transitions, 824 flow [2022-11-18 19:46:30,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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 19:46:30,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:30,673 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 19:46:30,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:46:30,673 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 19:46:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash -917619096, now seen corresponding path program 1 times [2022-11-18 19:46:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:30,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454444564] [2022-11-18 19:46:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:30,974 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 19:46:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:30,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454444564] [2022-11-18 19:46:30,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454444564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:30,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:30,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:46:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421789469] [2022-11-18 19:46:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:30,979 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-18 19:46:30,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 143 transitions, 824 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 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 19:46:30,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:30,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-18 19:46:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:32,318 INFO L130 PetriNetUnfolder]: 1500/3772 cut-off events. [2022-11-18 19:46:32,318 INFO L131 PetriNetUnfolder]: For 19535/19535 co-relation queries the response was YES. [2022-11-18 19:46:32,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16162 conditions, 3772 events. 1500/3772 cut-off events. For 19535/19535 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 31514 event pairs, 293 based on Foata normal form. 45/3710 useless extension candidates. Maximal degree in co-relation 16064. Up to 945 conditions per place. [2022-11-18 19:46:32,492 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 49 selfloop transitions, 31 changer transitions 59/228 dead transitions. [2022-11-18 19:46:32,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 228 transitions, 1937 flow [2022-11-18 19:46:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:46:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:46:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1482 transitions. [2022-11-18 19:46:32,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8382352941176471 [2022-11-18 19:46:32,498 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1482 transitions. [2022-11-18 19:46:32,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1482 transitions. [2022-11-18 19:46:32,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:32,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1482 transitions. [2022-11-18 19:46:32,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:46:32,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:32,509 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:32,510 INFO L175 Difference]: Start difference. First operand has 170 places, 143 transitions, 824 flow. Second operand 13 states and 1482 transitions. [2022-11-18 19:46:32,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 228 transitions, 1937 flow [2022-11-18 19:46:32,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 228 transitions, 1809 flow, removed 64 selfloop flow, removed 15 redundant places. [2022-11-18 19:46:32,571 INFO L231 Difference]: Finished difference. Result has 170 places, 149 transitions, 1022 flow [2022-11-18 19:46:32,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1022, PETRI_PLACES=170, PETRI_TRANSITIONS=149} [2022-11-18 19:46:32,574 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 27 predicate places. [2022-11-18 19:46:32,574 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 149 transitions, 1022 flow [2022-11-18 19:46:32,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 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 19:46:32,575 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:32,575 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] [2022-11-18 19:46:32,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:46:32,576 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 19:46:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1181114223, now seen corresponding path program 1 times [2022-11-18 19:46:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:32,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222439706] [2022-11-18 19:46:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:32,922 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 19:46:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222439706] [2022-11-18 19:46:32,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222439706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:32,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:32,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:46:32,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914646090] [2022-11-18 19:46:32,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:32,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:46:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:46:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:46:32,929 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-11-18 19:46:32,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 149 transitions, 1022 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 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 19:46:32,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:32,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-11-18 19:46:32,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:37,389 INFO L130 PetriNetUnfolder]: 10376/19110 cut-off events. [2022-11-18 19:46:37,390 INFO L131 PetriNetUnfolder]: For 79237/103043 co-relation queries the response was YES. [2022-11-18 19:46:37,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55803 conditions, 19110 events. 10376/19110 cut-off events. For 79237/103043 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 176139 event pairs, 586 based on Foata normal form. 381/18015 useless extension candidates. Maximal degree in co-relation 55710. Up to 6507 conditions per place. [2022-11-18 19:46:37,603 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 71 selfloop transitions, 20 changer transitions 14/231 dead transitions. [2022-11-18 19:46:37,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 231 transitions, 1864 flow [2022-11-18 19:46:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:46:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:46:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1203 transitions. [2022-11-18 19:46:37,611 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8845588235294117 [2022-11-18 19:46:37,612 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1203 transitions. [2022-11-18 19:46:37,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1203 transitions. [2022-11-18 19:46:37,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:37,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1203 transitions. [2022-11-18 19:46:37,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.3) internal successors, (1203), 10 states have internal predecessors, (1203), 0 states have call successors, (0), 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 19:46:37,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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 19:46:37,621 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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 19:46:37,621 INFO L175 Difference]: Start difference. First operand has 170 places, 149 transitions, 1022 flow. Second operand 10 states and 1203 transitions. [2022-11-18 19:46:37,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 231 transitions, 1864 flow [2022-11-18 19:46:37,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 231 transitions, 1807 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-18 19:46:37,681 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 1129 flow [2022-11-18 19:46:37,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1129, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2022-11-18 19:46:37,683 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 29 predicate places. [2022-11-18 19:46:37,683 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 1129 flow [2022-11-18 19:46:37,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 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 19:46:37,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:37,684 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] [2022-11-18 19:46:37,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:46:37,685 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 19:46:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1499244212, now seen corresponding path program 1 times [2022-11-18 19:46:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:37,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726013055] [2022-11-18 19:46:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:37,951 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 19:46:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:37,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726013055] [2022-11-18 19:46:37,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726013055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:37,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:37,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:46:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962547034] [2022-11-18 19:46:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:37,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:37,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2022-11-18 19:46:37,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 1129 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 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 19:46:37,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:37,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2022-11-18 19:46:37,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:40,935 INFO L130 PetriNetUnfolder]: 3802/11923 cut-off events. [2022-11-18 19:46:40,935 INFO L131 PetriNetUnfolder]: For 43323/46804 co-relation queries the response was YES. [2022-11-18 19:46:41,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40815 conditions, 11923 events. 3802/11923 cut-off events. For 43323/46804 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 141857 event pairs, 1319 based on Foata normal form. 248/11097 useless extension candidates. Maximal degree in co-relation 40713. Up to 3226 conditions per place. [2022-11-18 19:46:41,074 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 83 selfloop transitions, 45 changer transitions 15/250 dead transitions. [2022-11-18 19:46:41,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 250 transitions, 2330 flow [2022-11-18 19:46:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:46:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:46:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1483 transitions. [2022-11-18 19:46:41,079 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8388009049773756 [2022-11-18 19:46:41,079 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1483 transitions. [2022-11-18 19:46:41,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1483 transitions. [2022-11-18 19:46:41,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:41,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1483 transitions. [2022-11-18 19:46:41,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.07692307692308) internal successors, (1483), 13 states have internal predecessors, (1483), 0 states have call successors, (0), 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 19:46:41,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:41,087 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:41,088 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 1129 flow. Second operand 13 states and 1483 transitions. [2022-11-18 19:46:41,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 250 transitions, 2330 flow [2022-11-18 19:46:41,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 250 transitions, 2328 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:46:41,203 INFO L231 Difference]: Finished difference. Result has 193 places, 188 transitions, 1626 flow [2022-11-18 19:46:41,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1626, PETRI_PLACES=193, PETRI_TRANSITIONS=188} [2022-11-18 19:46:41,204 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 50 predicate places. [2022-11-18 19:46:41,204 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 188 transitions, 1626 flow [2022-11-18 19:46:41,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 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 19:46:41,205 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:41,205 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] [2022-11-18 19:46:41,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:46:41,206 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 19:46:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 217649848, now seen corresponding path program 1 times [2022-11-18 19:46:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:41,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10036843] [2022-11-18 19:46:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:41,628 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 19:46:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:41,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10036843] [2022-11-18 19:46:41,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10036843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:41,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:41,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:46:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180195239] [2022-11-18 19:46:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:41,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:46:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:46:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:46:41,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-11-18 19:46:41,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 188 transitions, 1626 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 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 19:46:41,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:41,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-11-18 19:46:41,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:47,415 INFO L130 PetriNetUnfolder]: 14503/27912 cut-off events. [2022-11-18 19:46:47,415 INFO L131 PetriNetUnfolder]: For 137166/157609 co-relation queries the response was YES. [2022-11-18 19:46:47,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110377 conditions, 27912 events. 14503/27912 cut-off events. For 137166/157609 co-relation queries the response was YES. Maximal size of possible extension queue 2295. Compared 287062 event pairs, 456 based on Foata normal form. 1237/27973 useless extension candidates. Maximal degree in co-relation 110268. Up to 9226 conditions per place. [2022-11-18 19:46:47,790 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 108 selfloop transitions, 38 changer transitions 19/305 dead transitions. [2022-11-18 19:46:47,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 305 transitions, 3250 flow [2022-11-18 19:46:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:46:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 19:46:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1567 transitions. [2022-11-18 19:46:47,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8863122171945701 [2022-11-18 19:46:47,795 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1567 transitions. [2022-11-18 19:46:47,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1567 transitions. [2022-11-18 19:46:47,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:47,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1567 transitions. [2022-11-18 19:46:47,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.53846153846153) internal successors, (1567), 13 states have internal predecessors, (1567), 0 states have call successors, (0), 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 19:46:47,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:47,804 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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 19:46:47,805 INFO L175 Difference]: Start difference. First operand has 193 places, 188 transitions, 1626 flow. Second operand 13 states and 1567 transitions. [2022-11-18 19:46:47,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 305 transitions, 3250 flow [2022-11-18 19:46:48,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 305 transitions, 3130 flow, removed 60 selfloop flow, removed 0 redundant places. [2022-11-18 19:46:48,376 INFO L231 Difference]: Finished difference. Result has 211 places, 202 transitions, 1697 flow [2022-11-18 19:46:48,377 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1697, PETRI_PLACES=211, PETRI_TRANSITIONS=202} [2022-11-18 19:46:48,377 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 68 predicate places. [2022-11-18 19:46:48,377 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 202 transitions, 1697 flow [2022-11-18 19:46:48,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 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 19:46:48,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:46:48,378 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 19:46:48,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:46:48,379 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 19:46:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1259593149, now seen corresponding path program 1 times [2022-11-18 19:46:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:48,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406163393] [2022-11-18 19:46:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:48,850 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 19:46:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:48,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406163393] [2022-11-18 19:46:48,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406163393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:46:48,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:46:48,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:46:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759383646] [2022-11-18 19:46:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:46:48,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:46:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:46:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:46:48,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-11-18 19:46:48,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 202 transitions, 1697 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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 19:46:48,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:46:48,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-11-18 19:46:48,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:46:54,586 INFO L130 PetriNetUnfolder]: 13861/27536 cut-off events. [2022-11-18 19:46:54,586 INFO L131 PetriNetUnfolder]: For 200872/225097 co-relation queries the response was YES. [2022-11-18 19:46:54,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132622 conditions, 27536 events. 13861/27536 cut-off events. For 200872/225097 co-relation queries the response was YES. Maximal size of possible extension queue 2312. Compared 293091 event pairs, 360 based on Foata normal form. 1725/28154 useless extension candidates. Maximal degree in co-relation 132504. Up to 8731 conditions per place. [2022-11-18 19:46:54,898 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 90 selfloop transitions, 58 changer transitions 67/342 dead transitions. [2022-11-18 19:46:54,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 342 transitions, 3826 flow [2022-11-18 19:46:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 19:46:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 19:46:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1930 transitions. [2022-11-18 19:46:54,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8869485294117647 [2022-11-18 19:46:54,904 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1930 transitions. [2022-11-18 19:46:54,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1930 transitions. [2022-11-18 19:46:54,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:46:54,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1930 transitions. [2022-11-18 19:46:54,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.625) internal successors, (1930), 16 states have internal predecessors, (1930), 0 states have call successors, (0), 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 19:46:54,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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 19:46:54,916 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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 19:46:54,917 INFO L175 Difference]: Start difference. First operand has 211 places, 202 transitions, 1697 flow. Second operand 16 states and 1930 transitions. [2022-11-18 19:46:54,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 342 transitions, 3826 flow [2022-11-18 19:47:01,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 342 transitions, 3676 flow, removed 58 selfloop flow, removed 9 redundant places. [2022-11-18 19:47:01,183 INFO L231 Difference]: Finished difference. Result has 221 places, 214 transitions, 1830 flow [2022-11-18 19:47:01,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1830, PETRI_PLACES=221, PETRI_TRANSITIONS=214} [2022-11-18 19:47:01,184 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 78 predicate places. [2022-11-18 19:47:01,184 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 214 transitions, 1830 flow [2022-11-18 19:47:01,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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 19:47:01,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:47:01,185 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] [2022-11-18 19:47:01,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:47:01,186 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 19:47:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1587561443, now seen corresponding path program 1 times [2022-11-18 19:47:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:01,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570413860] [2022-11-18 19:47:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:01,503 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 19:47:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:01,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570413860] [2022-11-18 19:47:01,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570413860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:01,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:01,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:47:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468484584] [2022-11-18 19:47:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:01,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:47:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:01,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:47:01,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:47:01,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-11-18 19:47:01,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 214 transitions, 1830 flow. Second operand has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 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 19:47:01,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:47:01,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-11-18 19:47:01,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:47:07,151 INFO L130 PetriNetUnfolder]: 13051/26352 cut-off events. [2022-11-18 19:47:07,151 INFO L131 PetriNetUnfolder]: For 191761/211374 co-relation queries the response was YES. [2022-11-18 19:47:07,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124061 conditions, 26352 events. 13051/26352 cut-off events. For 191761/211374 co-relation queries the response was YES. Maximal size of possible extension queue 2266. Compared 284735 event pairs, 351 based on Foata normal form. 1297/26558 useless extension candidates. Maximal degree in co-relation 124007. Up to 5371 conditions per place. [2022-11-18 19:47:07,465 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 61 selfloop transitions, 59 changer transitions 71/318 dead transitions. [2022-11-18 19:47:07,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 318 transitions, 3331 flow [2022-11-18 19:47:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 19:47:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 19:47:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2257 transitions. [2022-11-18 19:47:07,472 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8734520123839009 [2022-11-18 19:47:07,472 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2257 transitions. [2022-11-18 19:47:07,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2257 transitions. [2022-11-18 19:47:07,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:47:07,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2257 transitions. [2022-11-18 19:47:07,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.78947368421052) internal successors, (2257), 19 states have internal predecessors, (2257), 0 states have call successors, (0), 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 19:47:07,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 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 19:47:07,488 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 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 19:47:07,489 INFO L175 Difference]: Start difference. First operand has 221 places, 214 transitions, 1830 flow. Second operand 19 states and 2257 transitions. [2022-11-18 19:47:07,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 318 transitions, 3331 flow [2022-11-18 19:47:19,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 318 transitions, 2722 flow, removed 259 selfloop flow, removed 27 redundant places. [2022-11-18 19:47:19,195 INFO L231 Difference]: Finished difference. Result has 210 places, 206 transitions, 1495 flow [2022-11-18 19:47:19,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1495, PETRI_PLACES=210, PETRI_TRANSITIONS=206} [2022-11-18 19:47:19,196 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 67 predicate places. [2022-11-18 19:47:19,196 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 206 transitions, 1495 flow [2022-11-18 19:47:19,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 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 19:47:19,197 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:47:19,197 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] [2022-11-18 19:47:19,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:47:19,198 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 19:47:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1676905411, now seen corresponding path program 1 times [2022-11-18 19:47:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:19,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731823917] [2022-11-18 19:47:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:20,371 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 19:47:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:20,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731823917] [2022-11-18 19:47:20,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731823917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:20,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:20,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 19:47:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904138399] [2022-11-18 19:47:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 19:47:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 19:47:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:47:20,375 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 136 [2022-11-18 19:47:20,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 206 transitions, 1495 flow. Second operand has 13 states, 13 states have (on average 101.46153846153847) internal successors, (1319), 13 states have internal predecessors, (1319), 0 states have call successors, (0), 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 19:47:20,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:47:20,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 136 [2022-11-18 19:47:20,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:47:23,193 INFO L130 PetriNetUnfolder]: 5306/17615 cut-off events. [2022-11-18 19:47:23,193 INFO L131 PetriNetUnfolder]: For 51720/54783 co-relation queries the response was YES. [2022-11-18 19:47:23,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59537 conditions, 17615 events. 5306/17615 cut-off events. For 51720/54783 co-relation queries the response was YES. Maximal size of possible extension queue 2321. Compared 249914 event pairs, 22 based on Foata normal form. 3/16467 useless extension candidates. Maximal degree in co-relation 59421. Up to 1844 conditions per place. [2022-11-18 19:47:23,379 INFO L137 encePairwiseOnDemand]: 117/136 looper letters, 75 selfloop transitions, 87 changer transitions 31/334 dead transitions. [2022-11-18 19:47:23,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 334 transitions, 3608 flow [2022-11-18 19:47:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:47:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-18 19:47:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1884 transitions. [2022-11-18 19:47:23,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7696078431372549 [2022-11-18 19:47:23,384 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1884 transitions. [2022-11-18 19:47:23,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1884 transitions. [2022-11-18 19:47:23,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:47:23,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1884 transitions. [2022-11-18 19:47:23,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 104.66666666666667) internal successors, (1884), 18 states have internal predecessors, (1884), 0 states have call successors, (0), 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 19:47:23,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 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 19:47:23,396 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 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 19:47:23,396 INFO L175 Difference]: Start difference. First operand has 210 places, 206 transitions, 1495 flow. Second operand 18 states and 1884 transitions. [2022-11-18 19:47:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 334 transitions, 3608 flow [2022-11-18 19:47:26,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 334 transitions, 3308 flow, removed 106 selfloop flow, removed 17 redundant places. [2022-11-18 19:47:26,418 INFO L231 Difference]: Finished difference. Result has 215 places, 271 transitions, 2619 flow [2022-11-18 19:47:26,418 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2619, PETRI_PLACES=215, PETRI_TRANSITIONS=271} [2022-11-18 19:47:26,419 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 72 predicate places. [2022-11-18 19:47:26,419 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 271 transitions, 2619 flow [2022-11-18 19:47:26,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.46153846153847) internal successors, (1319), 13 states have internal predecessors, (1319), 0 states have call successors, (0), 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 19:47:26,420 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:47:26,420 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] [2022-11-18 19:47:26,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:47:26,420 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 19:47:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 735133601, now seen corresponding path program 2 times [2022-11-18 19:47:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:26,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658401531] [2022-11-18 19:47:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:26,750 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 19:47:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658401531] [2022-11-18 19:47:26,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658401531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:26,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:26,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:47:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156296987] [2022-11-18 19:47:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:26,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:47:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:47:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:47:26,754 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 136 [2022-11-18 19:47:26,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 271 transitions, 2619 flow. Second operand has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 0 states have call successors, (0), 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 19:47:26,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:47:26,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 136 [2022-11-18 19:47:26,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:47:29,912 INFO L130 PetriNetUnfolder]: 6401/21417 cut-off events. [2022-11-18 19:47:29,913 INFO L131 PetriNetUnfolder]: For 46439/47072 co-relation queries the response was YES. [2022-11-18 19:47:30,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65740 conditions, 21417 events. 6401/21417 cut-off events. For 46439/47072 co-relation queries the response was YES. Maximal size of possible extension queue 2708. Compared 315736 event pairs, 64 based on Foata normal form. 7/20169 useless extension candidates. Maximal degree in co-relation 65699. Up to 2529 conditions per place. [2022-11-18 19:47:30,125 INFO L137 encePairwiseOnDemand]: 124/136 looper letters, 24 selfloop transitions, 8 changer transitions 146/318 dead transitions. [2022-11-18 19:47:30,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 318 transitions, 3587 flow [2022-11-18 19:47:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:47:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:47:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1006 transitions. [2022-11-18 19:47:30,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8218954248366013 [2022-11-18 19:47:30,128 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1006 transitions. [2022-11-18 19:47:30,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1006 transitions. [2022-11-18 19:47:30,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:47:30,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1006 transitions. [2022-11-18 19:47:30,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.77777777777777) internal successors, (1006), 9 states have internal predecessors, (1006), 0 states have call successors, (0), 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 19:47:30,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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 19:47:30,133 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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 19:47:30,134 INFO L175 Difference]: Start difference. First operand has 215 places, 271 transitions, 2619 flow. Second operand 9 states and 1006 transitions. [2022-11-18 19:47:30,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 318 transitions, 3587 flow [2022-11-18 19:47:34,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 318 transitions, 3547 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-11-18 19:47:34,032 INFO L231 Difference]: Finished difference. Result has 217 places, 170 transitions, 948 flow [2022-11-18 19:47:34,032 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=948, PETRI_PLACES=217, PETRI_TRANSITIONS=170} [2022-11-18 19:47:34,033 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 74 predicate places. [2022-11-18 19:47:34,033 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 170 transitions, 948 flow [2022-11-18 19:47:34,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 0 states have call successors, (0), 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 19:47:34,034 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:47:34,034 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] [2022-11-18 19:47:34,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:47:34,034 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 19:47:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1186555581, now seen corresponding path program 3 times [2022-11-18 19:47:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:34,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495705226] [2022-11-18 19:47:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:47:34,752 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 19:47:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:47:34,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495705226] [2022-11-18 19:47:34,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495705226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:47:34,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:47:34,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:47:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575994891] [2022-11-18 19:47:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:47:34,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:47:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:47:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:47:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:47:34,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-11-18 19:47:34,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 170 transitions, 948 flow. Second operand has 10 states, 10 states have (on average 112.1) internal successors, (1121), 10 states have internal predecessors, (1121), 0 states have call successors, (0), 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 19:47:34,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:47:34,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-11-18 19:47:34,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:47:35,283 INFO L130 PetriNetUnfolder]: 500/2115 cut-off events. [2022-11-18 19:47:35,283 INFO L131 PetriNetUnfolder]: For 4090/4141 co-relation queries the response was YES. [2022-11-18 19:47:35,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6219 conditions, 2115 events. 500/2115 cut-off events. For 4090/4141 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 21572 event pairs, 4 based on Foata normal form. 1/2028 useless extension candidates. Maximal degree in co-relation 6176. Up to 238 conditions per place. [2022-11-18 19:47:35,305 INFO L137 encePairwiseOnDemand]: 127/136 looper letters, 17 selfloop transitions, 5 changer transitions 50/176 dead transitions. [2022-11-18 19:47:35,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 176 transitions, 1036 flow [2022-11-18 19:47:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:47:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:47:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1128 transitions. [2022-11-18 19:47:35,308 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8294117647058824 [2022-11-18 19:47:35,309 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1128 transitions. [2022-11-18 19:47:35,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1128 transitions. [2022-11-18 19:47:35,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:47:35,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1128 transitions. [2022-11-18 19:47:35,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 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 19:47:35,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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 19:47:35,314 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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 19:47:35,315 INFO L175 Difference]: Start difference. First operand has 217 places, 170 transitions, 948 flow. Second operand 10 states and 1128 transitions. [2022-11-18 19:47:35,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 176 transitions, 1036 flow [2022-11-18 19:47:35,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 176 transitions, 887 flow, removed 22 selfloop flow, removed 28 redundant places. [2022-11-18 19:47:35,395 INFO L231 Difference]: Finished difference. Result has 194 places, 126 transitions, 465 flow [2022-11-18 19:47:35,396 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=465, PETRI_PLACES=194, PETRI_TRANSITIONS=126} [2022-11-18 19:47:35,397 INFO L288 CegarLoopForPetriNet]: 143 programPoint places, 51 predicate places. [2022-11-18 19:47:35,397 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 126 transitions, 465 flow [2022-11-18 19:47:35,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.1) internal successors, (1121), 10 states have internal predecessors, (1121), 0 states have call successors, (0), 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 19:47:35,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:47:35,398 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] [2022-11-18 19:47:35,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:47:35,399 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 19:47:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:47:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -322704253, now seen corresponding path program 4 times [2022-11-18 19:47:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:47:35,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862029013] [2022-11-18 19:47:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:47:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:47:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:47:35,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:47:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:47:35,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:47:35,585 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:47:35,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 19:47:35,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 19:47:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 19:47:35,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 19:47:35,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 19:47:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 19:47:35,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 19:47:35,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:47:35,595 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:47:35,602 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:47:35,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:47:35,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:47:35 BasicIcfg [2022-11-18 19:47:35,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:47:35,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:47:35,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:47:35,791 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:47:35,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:46:22" (3/4) ... [2022-11-18 19:47:35,793 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:47:35,953 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:47:35,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:47:35,954 INFO L158 Benchmark]: Toolchain (without parser) took 74657.04ms. Allocated memory was 104.9MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 72.3MB in the beginning and 10.1GB in the end (delta: -10.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-18 19:47:35,955 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 61.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:47:35,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.36ms. Allocated memory is still 104.9MB. Free memory was 72.1MB in the beginning and 67.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 19:47:35,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.23ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 65.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:47:35,956 INFO L158 Benchmark]: Boogie Preprocessor took 30.20ms. Allocated memory is still 104.9MB. Free memory was 65.1MB in the beginning and 63.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:47:35,956 INFO L158 Benchmark]: RCFGBuilder took 855.38ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 63.4MB in the beginning and 100.0MB in the end (delta: -36.6MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-11-18 19:47:35,957 INFO L158 Benchmark]: TraceAbstraction took 72845.34ms. Allocated memory was 142.6MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 98.9MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-18 19:47:35,957 INFO L158 Benchmark]: Witness Printer took 162.89ms. Allocated memory is still 12.6GB. Free memory was 10.2GB in the beginning and 10.1GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-18 19:47:35,961 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.26ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 61.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.36ms. Allocated memory is still 104.9MB. Free memory was 72.1MB in the beginning and 67.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.23ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 65.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.20ms. Allocated memory is still 104.9MB. Free memory was 65.1MB in the beginning and 63.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 855.38ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 63.4MB in the beginning and 100.0MB in the end (delta: -36.6MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 72845.34ms. Allocated memory was 142.6MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 98.9MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 162.89ms. Allocated memory is still 12.6GB. Free memory was 10.2GB in the beginning and 10.1GB in the end (delta: 35.7MB). 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: [L740] 0 _Bool z$r_buff1_thd4; VAL [z$r_buff1_thd4=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [z$r_buff1_thd2=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L736] 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] [L737] 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] [L747] 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] [L745] 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] [L748] 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] [L729] 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] [L743] 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] [L732] 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] [L733] 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] [L731] 0 _Bool z$r_buff0_thd0; VAL [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] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__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] [L734] 0 _Bool z$r_buff0_thd3; VAL [__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] [L730] 0 int z$mem_tmp; VAL [__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] [L735] 0 _Bool z$r_buff0_thd4; VAL [__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] [L741] 0 _Bool z$read_delayed; VAL [__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] [L718] 0 int a = 0; VAL [__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] [L720] 0 int b = 0; VAL [__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] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__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] [L742] 0 int *z$read_delayed_var; VAL [__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] [L746] 0 _Bool z$w_buff1_used; VAL [__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_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] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=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] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=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] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=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] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=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] [L724] 0 int x = 0; VAL [__unbuffered_cnt=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] [L726] 0 int y = 0; VAL [__unbuffered_cnt=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] [L728] 0 int z = 0; VAL [__unbuffered_cnt=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] [L854] 0 pthread_t t1061; VAL [__unbuffered_cnt=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, t1061={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] [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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(&t1061, ((void *)0), P0, ((void *)0))=-3, t1061={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] [L856] 0 pthread_t t1062; VAL [__unbuffered_cnt=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, t1061={5:0}, t1062={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] [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t1062, ((void *)0), P1, ((void *)0))=-2, t1061={5:0}, t1062={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] [L858] 0 pthread_t t1063; VAL [__unbuffered_cnt=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, t1061={5:0}, t1062={6:0}, t1063={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] [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t1063, ((void *)0), P2, ((void *)0))=-1, t1061={5:0}, t1062={6:0}, t1063={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] [L860] 0 pthread_t t1064; VAL [__unbuffered_cnt=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, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={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] [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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(&t1064, ((void *)0), P3, ((void *)0))=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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] [L823] 4 a = 1 VAL [__unbuffered_cnt=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] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=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] [L767] 2 x = 2 VAL [__unbuffered_cnt=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] [L770] 2 y = 1 VAL [__unbuffered_cnt=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=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] [L782] 3 y = 2 VAL [__unbuffered_cnt=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=2, 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] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 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) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=0, x=2, y=2, 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] [L832] 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) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 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=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=0, x=2, y=2, 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] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=0, x=2, y=2, 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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=0, x=2, y=2, 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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=0, x=2, y=2, 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] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __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=0, x=2, y=2, 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] [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __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, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, x=2, y=2, 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] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 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 [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 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_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, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __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, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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: 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: 855]: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 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: 72.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 65.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1082 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1082 mSDsluCounter, 1189 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 942 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 247 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2619occurred in iteration=11, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 5378 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 19:47:35,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8b2efd-d147-4373-a505-9bf1917aad95/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