./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:17:03,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:17:03,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:17:03,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:17:03,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:17:03,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:17:03,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:17:03,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:17:03,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:17:03,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:17:03,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:17:03,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:17:03,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:17:03,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:17:03,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:17:03,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:17:03,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:17:03,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:17:03,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:17:03,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:17:03,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:17:03,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:17:03,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:17:03,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:17:03,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:17:03,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:17:03,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:17:03,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:17:03,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:17:03,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:17:03,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:17:03,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:17:03,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:17:03,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:17:03,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:17:03,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:17:03,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:17:03,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:17:03,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:17:03,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:17:03,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:17:03,172 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:17:03,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:17:03,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:17:03,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:17:03,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:17:03,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:17:03,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:17:03,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:17:03,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:17:03,208 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:17:03,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:17:03,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:17:03,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:17:03,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:17:03,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:17:03,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:17:03,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:17:03,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:17:03,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:17:03,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:17:03,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:17:03,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:17:03,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:17:03,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:17:03,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:17:03,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:17:03,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:17:03,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:17:03,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:17:03,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:17:03,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:17:03,214 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:17:03,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:17:03,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:17:03,214 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_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0032fd1b0879d5a3b3f4ef67d0327f489d9a349f94447e8a77b1324c1477f2bb [2022-11-21 16:17:03,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:17:03,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:17:03,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:17:03,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:17:03,536 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:17:03,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix032.opt.i [2022-11-21 16:17:06,567 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:17:06,915 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:17:06,916 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/sv-benchmarks/c/pthread-wmm/mix032.opt.i [2022-11-21 16:17:06,929 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/data/5d581ab9e/e4e365c376a04463b7899ad77f48028f/FLAGf6ea465cd [2022-11-21 16:17:06,944 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/data/5d581ab9e/e4e365c376a04463b7899ad77f48028f [2022-11-21 16:17:06,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:17:06,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:17:06,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:17:06,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:17:06,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:17:06,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:17:06" (1/1) ... [2022-11-21 16:17:06,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183a1fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:06, skipping insertion in model container [2022-11-21 16:17:06,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:17:06" (1/1) ... [2022-11-21 16:17:06,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:17:06,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:17:07,202 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/sv-benchmarks/c/pthread-wmm/mix032.opt.i[944,957] [2022-11-21 16:17:07,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:17:07,443 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:17:07,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/sv-benchmarks/c/pthread-wmm/mix032.opt.i[944,957] [2022-11-21 16:17:07,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:17:07,600 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:17:07,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07 WrapperNode [2022-11-21 16:17:07,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:17:07,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:17:07,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:17:07,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:17:07,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,657 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-11-21 16:17:07,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:17:07,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:17:07,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:17:07,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:17:07,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,688 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:17:07,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:17:07,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:17:07,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:17:07,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (1/1) ... [2022-11-21 16:17:07,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:17:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:17:07,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:17:07,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:17:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:17:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:17:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:17:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:17:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:17:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:17:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:17:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:17:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:17:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:17:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:17:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:17:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:17:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:17:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:17:07,820 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:17:08,072 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:17:08,075 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:17:08,403 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:17:08,710 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:17:08,718 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:17:08,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:17:08 BoogieIcfgContainer [2022-11-21 16:17:08,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:17:08,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:17:08,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:17:08,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:17:08,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:17:06" (1/3) ... [2022-11-21 16:17:08,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b4149b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:17:08, skipping insertion in model container [2022-11-21 16:17:08,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:17:07" (2/3) ... [2022-11-21 16:17:08,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b4149b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:17:08, skipping insertion in model container [2022-11-21 16:17:08,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:17:08" (3/3) ... [2022-11-21 16:17:08,738 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2022-11-21 16:17:08,748 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:17:08,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:17:08,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 16:17:08,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:17:08,816 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:17:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-11-21 16:17:08,913 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-21 16:17:08,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:17:08,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-21 16:17:08,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-11-21 16:17:08,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-11-21 16:17:08,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:17:08,942 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;@85a76a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:17:08,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-21 16:17:08,964 INFO L130 PetriNetUnfolder]: 0/78 cut-off events. [2022-11-21 16:17:08,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:17:08,965 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:08,965 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:08,966 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1652544487, now seen corresponding path program 1 times [2022-11-21 16:17:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:08,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265638568] [2022-11-21 16:17:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:09,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265638568] [2022-11-21 16:17:09,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265638568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:09,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:09,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:17:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048069828] [2022-11-21 16:17:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:09,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:17:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:09,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:17:09,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:17:09,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 122 [2022-11-21 16:17:09,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:09,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:09,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 122 [2022-11-21 16:17:09,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:09,874 INFO L130 PetriNetUnfolder]: 10/157 cut-off events. [2022-11-21 16:17:09,874 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-21 16:17:09,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 157 events. 10/157 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 286 event pairs, 2 based on Foata normal form. 7/158 useless extension candidates. Maximal degree in co-relation 139. Up to 17 conditions per place. [2022-11-21 16:17:09,877 INFO L137 encePairwiseOnDemand]: 117/122 looper letters, 8 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-11-21 16:17:09,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 263 flow [2022-11-21 16:17:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:17:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:17:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2022-11-21 16:17:09,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9426229508196722 [2022-11-21 16:17:09,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2022-11-21 16:17:09,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2022-11-21 16:17:09,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:09,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2022-11-21 16:17:09,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:09,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:09,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:09,927 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 345 transitions. [2022-11-21 16:17:09,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 263 flow [2022-11-21 16:17:09,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-21 16:17:09,937 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2022-11-21 16:17:09,940 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2022-11-21 16:17:09,948 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-11-21 16:17:09,949 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2022-11-21 16:17:09,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:09,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:09,951 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:09,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:17:09,951 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1093418041, now seen corresponding path program 1 times [2022-11-21 16:17:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:09,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040760601] [2022-11-21 16:17:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:10,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040760601] [2022-11-21 16:17:10,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040760601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:10,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:17:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698701919] [2022-11-21 16:17:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:10,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:17:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:17:10,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:17:10,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2022-11-21 16:17:10,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:10,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:10,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2022-11-21 16:17:10,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:11,313 INFO L130 PetriNetUnfolder]: 572/1526 cut-off events. [2022-11-21 16:17:11,314 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-21 16:17:11,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 1526 events. 572/1526 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10386 event pairs, 109 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 2433. Up to 405 conditions per place. [2022-11-21 16:17:11,331 INFO L137 encePairwiseOnDemand]: 114/122 looper letters, 22 selfloop transitions, 4 changer transitions 51/158 dead transitions. [2022-11-21 16:17:11,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 158 transitions, 464 flow [2022-11-21 16:17:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:17:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:17:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1018 transitions. [2022-11-21 16:17:11,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8344262295081967 [2022-11-21 16:17:11,339 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1018 transitions. [2022-11-21 16:17:11,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1018 transitions. [2022-11-21 16:17:11,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:11,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1018 transitions. [2022-11-21 16:17:11,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.8) internal successors, (1018), 10 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:11,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:11,349 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:11,349 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 10 states and 1018 transitions. [2022-11-21 16:17:11,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 158 transitions, 464 flow [2022-11-21 16:17:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 158 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:17:11,356 INFO L231 Difference]: Finished difference. Result has 138 places, 103 transitions, 236 flow [2022-11-21 16:17:11,356 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=138, PETRI_TRANSITIONS=103} [2022-11-21 16:17:11,357 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 11 predicate places. [2022-11-21 16:17:11,358 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 103 transitions, 236 flow [2022-11-21 16:17:11,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:11,359 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:11,359 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] [2022-11-21 16:17:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:17:11,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash 866926838, now seen corresponding path program 1 times [2022-11-21 16:17:11,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:11,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845546886] [2022-11-21 16:17:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:11,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845546886] [2022-11-21 16:17:11,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845546886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:11,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:11,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:17:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347984412] [2022-11-21 16:17:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:17:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:17:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:17:11,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 122 [2022-11-21 16:17:11,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 103 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:11,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:11,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 122 [2022-11-21 16:17:11,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:12,167 INFO L130 PetriNetUnfolder]: 317/755 cut-off events. [2022-11-21 16:17:12,167 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-11-21 16:17:12,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 755 events. 317/755 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3825 event pairs, 125 based on Foata normal form. 18/735 useless extension candidates. Maximal degree in co-relation 1425. Up to 284 conditions per place. [2022-11-21 16:17:12,173 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 27 selfloop transitions, 2 changer transitions 31/141 dead transitions. [2022-11-21 16:17:12,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 141 transitions, 455 flow [2022-11-21 16:17:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:17:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:17:12,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2022-11-21 16:17:12,177 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8351548269581056 [2022-11-21 16:17:12,177 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2022-11-21 16:17:12,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2022-11-21 16:17:12,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:12,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2022-11-21 16:17:12,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.88888888888889) internal successors, (917), 9 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:12,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:12,184 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:12,184 INFO L175 Difference]: Start difference. First operand has 138 places, 103 transitions, 236 flow. Second operand 9 states and 917 transitions. [2022-11-21 16:17:12,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 141 transitions, 455 flow [2022-11-21 16:17:12,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 141 transitions, 417 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-21 16:17:12,191 INFO L231 Difference]: Finished difference. Result has 126 places, 103 transitions, 236 flow [2022-11-21 16:17:12,192 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=126, PETRI_TRANSITIONS=103} [2022-11-21 16:17:12,192 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2022-11-21 16:17:12,193 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 103 transitions, 236 flow [2022-11-21 16:17:12,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:12,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:12,193 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:12,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:17:12,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1735627512, now seen corresponding path program 1 times [2022-11-21 16:17:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:12,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535466533] [2022-11-21 16:17:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535466533] [2022-11-21 16:17:12,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535466533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:12,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:12,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:17:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401417239] [2022-11-21 16:17:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:12,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:17:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:12,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:17:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:17:12,577 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-11-21 16:17:12,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 103 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:12,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:12,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-11-21 16:17:12,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:12,999 INFO L130 PetriNetUnfolder]: 439/1028 cut-off events. [2022-11-21 16:17:13,000 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-21 16:17:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1028 events. 439/1028 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6405 event pairs, 12 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1829. Up to 277 conditions per place. [2022-11-21 16:17:13,008 INFO L137 encePairwiseOnDemand]: 112/122 looper letters, 25 selfloop transitions, 6 changer transitions 40/156 dead transitions. [2022-11-21 16:17:13,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 156 transitions, 488 flow [2022-11-21 16:17:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:17:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:17:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1073 transitions. [2022-11-21 16:17:13,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8795081967213115 [2022-11-21 16:17:13,013 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1073 transitions. [2022-11-21 16:17:13,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1073 transitions. [2022-11-21 16:17:13,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:13,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1073 transitions. [2022-11-21 16:17:13,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,028 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,028 INFO L175 Difference]: Start difference. First operand has 126 places, 103 transitions, 236 flow. Second operand 10 states and 1073 transitions. [2022-11-21 16:17:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 156 transitions, 488 flow [2022-11-21 16:17:13,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 156 transitions, 472 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-21 16:17:13,038 INFO L231 Difference]: Finished difference. Result has 127 places, 105 transitions, 274 flow [2022-11-21 16:17:13,038 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2022-11-21 16:17:13,041 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-11-21 16:17:13,046 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 274 flow [2022-11-21 16:17:13,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:13,050 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:13,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:17:13,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 754537687, now seen corresponding path program 1 times [2022-11-21 16:17:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:13,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349651467] [2022-11-21 16:17:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:13,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349651467] [2022-11-21 16:17:13,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349651467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:13,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:13,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:17:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787392684] [2022-11-21 16:17:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:17:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:17:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:17:13,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-11-21 16:17:13,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:13,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-11-21 16:17:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:13,831 INFO L130 PetriNetUnfolder]: 172/536 cut-off events. [2022-11-21 16:17:13,832 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2022-11-21 16:17:13,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 536 events. 172/536 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2736 event pairs, 13 based on Foata normal form. 18/551 useless extension candidates. Maximal degree in co-relation 1304. Up to 136 conditions per place. [2022-11-21 16:17:13,837 INFO L137 encePairwiseOnDemand]: 113/122 looper letters, 29 selfloop transitions, 9 changer transitions 31/154 dead transitions. [2022-11-21 16:17:13,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 154 transitions, 643 flow [2022-11-21 16:17:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:17:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:17:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1071 transitions. [2022-11-21 16:17:13,841 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8778688524590164 [2022-11-21 16:17:13,841 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1071 transitions. [2022-11-21 16:17:13,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1071 transitions. [2022-11-21 16:17:13,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:13,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1071 transitions. [2022-11-21 16:17:13,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,848 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,849 INFO L175 Difference]: Start difference. First operand has 127 places, 105 transitions, 274 flow. Second operand 10 states and 1071 transitions. [2022-11-21 16:17:13,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 154 transitions, 643 flow [2022-11-21 16:17:13,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 154 transitions, 619 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-21 16:17:13,855 INFO L231 Difference]: Finished difference. Result has 131 places, 108 transitions, 342 flow [2022-11-21 16:17:13,855 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=131, PETRI_TRANSITIONS=108} [2022-11-21 16:17:13,856 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2022-11-21 16:17:13,856 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 108 transitions, 342 flow [2022-11-21 16:17:13,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:13,857 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:13,857 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-21 16:17:13,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:17:13,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2106913025, now seen corresponding path program 1 times [2022-11-21 16:17:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:13,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488783701] [2022-11-21 16:17:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:14,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:14,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488783701] [2022-11-21 16:17:14,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488783701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:14,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:14,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:17:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605988508] [2022-11-21 16:17:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:14,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:17:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:17:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:17:14,696 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2022-11-21 16:17:14,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 108 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:14,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:14,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2022-11-21 16:17:14,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:15,164 INFO L130 PetriNetUnfolder]: 136/658 cut-off events. [2022-11-21 16:17:15,164 INFO L131 PetriNetUnfolder]: For 1053/1099 co-relation queries the response was YES. [2022-11-21 16:17:15,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 658 events. 136/658 cut-off events. For 1053/1099 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3758 event pairs, 41 based on Foata normal form. 18/662 useless extension candidates. Maximal degree in co-relation 1596. Up to 135 conditions per place. [2022-11-21 16:17:15,171 INFO L137 encePairwiseOnDemand]: 109/122 looper letters, 37 selfloop transitions, 13 changer transitions 10/142 dead transitions. [2022-11-21 16:17:15,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 142 transitions, 545 flow [2022-11-21 16:17:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:17:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-21 16:17:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1154 transitions. [2022-11-21 16:17:15,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7882513661202186 [2022-11-21 16:17:15,175 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1154 transitions. [2022-11-21 16:17:15,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1154 transitions. [2022-11-21 16:17:15,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:15,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1154 transitions. [2022-11-21 16:17:15,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.16666666666667) internal successors, (1154), 12 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 122.0) internal successors, (1586), 13 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,182 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 122.0) internal successors, (1586), 13 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,182 INFO L175 Difference]: Start difference. First operand has 131 places, 108 transitions, 342 flow. Second operand 12 states and 1154 transitions. [2022-11-21 16:17:15,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 142 transitions, 545 flow [2022-11-21 16:17:15,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 142 transitions, 489 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-11-21 16:17:15,191 INFO L231 Difference]: Finished difference. Result has 138 places, 116 transitions, 371 flow [2022-11-21 16:17:15,192 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=371, PETRI_PLACES=138, PETRI_TRANSITIONS=116} [2022-11-21 16:17:15,192 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 11 predicate places. [2022-11-21 16:17:15,193 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 116 transitions, 371 flow [2022-11-21 16:17:15,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:15,193 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-21 16:17:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:17:15,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -309579467, now seen corresponding path program 2 times [2022-11-21 16:17:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:15,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104843476] [2022-11-21 16:17:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104843476] [2022-11-21 16:17:15,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104843476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:15,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:15,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:17:15,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840775635] [2022-11-21 16:17:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:15,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:17:15,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:15,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:17:15,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:17:15,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-11-21 16:17:15,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 116 transitions, 371 flow. Second operand has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:15,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-11-21 16:17:15,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:15,907 INFO L130 PetriNetUnfolder]: 103/454 cut-off events. [2022-11-21 16:17:15,907 INFO L131 PetriNetUnfolder]: For 577/597 co-relation queries the response was YES. [2022-11-21 16:17:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 454 events. 103/454 cut-off events. For 577/597 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2354 event pairs, 2 based on Foata normal form. 23/472 useless extension candidates. Maximal degree in co-relation 1182. Up to 103 conditions per place. [2022-11-21 16:17:15,911 INFO L137 encePairwiseOnDemand]: 113/122 looper letters, 27 selfloop transitions, 12 changer transitions 23/148 dead transitions. [2022-11-21 16:17:15,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 148 transitions, 669 flow [2022-11-21 16:17:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:17:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 16:17:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1153 transitions. [2022-11-21 16:17:15,914 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8591654247391952 [2022-11-21 16:17:15,914 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1153 transitions. [2022-11-21 16:17:15,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1153 transitions. [2022-11-21 16:17:15,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:15,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1153 transitions. [2022-11-21 16:17:15,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 104.81818181818181) internal successors, (1153), 11 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,922 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,922 INFO L175 Difference]: Start difference. First operand has 138 places, 116 transitions, 371 flow. Second operand 11 states and 1153 transitions. [2022-11-21 16:17:15,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 148 transitions, 669 flow [2022-11-21 16:17:15,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 148 transitions, 618 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-11-21 16:17:15,928 INFO L231 Difference]: Finished difference. Result has 139 places, 113 transitions, 363 flow [2022-11-21 16:17:15,928 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=363, PETRI_PLACES=139, PETRI_TRANSITIONS=113} [2022-11-21 16:17:15,929 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 12 predicate places. [2022-11-21 16:17:15,929 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 113 transitions, 363 flow [2022-11-21 16:17:15,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:15,930 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:15,930 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-21 16:17:15,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:17:15,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1532596051, now seen corresponding path program 1 times [2022-11-21 16:17:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:15,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978843659] [2022-11-21 16:17:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:16,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978843659] [2022-11-21 16:17:16,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978843659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:16,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:16,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:17:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726222257] [2022-11-21 16:17:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:16,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:17:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:17:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:17:16,604 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2022-11-21 16:17:16,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 113 transitions, 363 flow. Second operand has 9 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:16,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:16,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2022-11-21 16:17:16,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:17,037 INFO L130 PetriNetUnfolder]: 144/635 cut-off events. [2022-11-21 16:17:17,037 INFO L131 PetriNetUnfolder]: For 522/541 co-relation queries the response was YES. [2022-11-21 16:17:17,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 635 events. 144/635 cut-off events. For 522/541 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3696 event pairs, 23 based on Foata normal form. 1/621 useless extension candidates. Maximal degree in co-relation 1471. Up to 131 conditions per place. [2022-11-21 16:17:17,043 INFO L137 encePairwiseOnDemand]: 107/122 looper letters, 40 selfloop transitions, 18 changer transitions 6/146 dead transitions. [2022-11-21 16:17:17,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 146 transitions, 612 flow [2022-11-21 16:17:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:17:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:17:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2022-11-21 16:17:17,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7901639344262295 [2022-11-21 16:17:17,046 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2022-11-21 16:17:17,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2022-11-21 16:17:17,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:17,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2022-11-21 16:17:17,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,053 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,053 INFO L175 Difference]: Start difference. First operand has 139 places, 113 transitions, 363 flow. Second operand 10 states and 964 transitions. [2022-11-21 16:17:17,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 146 transitions, 612 flow [2022-11-21 16:17:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 146 transitions, 528 flow, removed 21 selfloop flow, removed 16 redundant places. [2022-11-21 16:17:17,062 INFO L231 Difference]: Finished difference. Result has 135 places, 127 transitions, 430 flow [2022-11-21 16:17:17,063 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=430, PETRI_PLACES=135, PETRI_TRANSITIONS=127} [2022-11-21 16:17:17,066 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 8 predicate places. [2022-11-21 16:17:17,066 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 430 flow [2022-11-21 16:17:17,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,067 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:17,067 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-21 16:17:17,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:17:17,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1882686889, now seen corresponding path program 2 times [2022-11-21 16:17:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:17,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742343755] [2022-11-21 16:17:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:17,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:17,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742343755] [2022-11-21 16:17:17,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742343755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:17,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:17,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:17:17,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531214186] [2022-11-21 16:17:17,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:17,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:17:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:17:17,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:17:17,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-11-21 16:17:17,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 127 transitions, 430 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:17,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-11-21 16:17:17,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:17,731 INFO L130 PetriNetUnfolder]: 165/746 cut-off events. [2022-11-21 16:17:17,731 INFO L131 PetriNetUnfolder]: For 522/528 co-relation queries the response was YES. [2022-11-21 16:17:17,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 746 events. 165/746 cut-off events. For 522/528 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4886 event pairs, 18 based on Foata normal form. 1/733 useless extension candidates. Maximal degree in co-relation 1699. Up to 129 conditions per place. [2022-11-21 16:17:17,736 INFO L137 encePairwiseOnDemand]: 112/122 looper letters, 29 selfloop transitions, 5 changer transitions 31/149 dead transitions. [2022-11-21 16:17:17,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 149 transitions, 677 flow [2022-11-21 16:17:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:17:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 16:17:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 786 transitions. [2022-11-21 16:17:17,739 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.805327868852459 [2022-11-21 16:17:17,739 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 786 transitions. [2022-11-21 16:17:17,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 786 transitions. [2022-11-21 16:17:17,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:17,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 786 transitions. [2022-11-21 16:17:17,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,745 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,745 INFO L175 Difference]: Start difference. First operand has 135 places, 127 transitions, 430 flow. Second operand 8 states and 786 transitions. [2022-11-21 16:17:17,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 149 transitions, 677 flow [2022-11-21 16:17:17,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 149 transitions, 659 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-21 16:17:17,751 INFO L231 Difference]: Finished difference. Result has 139 places, 114 transitions, 335 flow [2022-11-21 16:17:17,751 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=139, PETRI_TRANSITIONS=114} [2022-11-21 16:17:17,752 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 12 predicate places. [2022-11-21 16:17:17,752 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 114 transitions, 335 flow [2022-11-21 16:17:17,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:17,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:17,753 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-21 16:17:17,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:17:17,753 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -873302029, now seen corresponding path program 3 times [2022-11-21 16:17:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:17,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957303591] [2022-11-21 16:17:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:17:18,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:18,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957303591] [2022-11-21 16:17:18,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957303591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:17:18,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:17:18,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:17:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944968356] [2022-11-21 16:17:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:17:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:17:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:17:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:17:18,083 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-11-21 16:17:18,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 114 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:18,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:18,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-11-21 16:17:18,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:18,344 INFO L130 PetriNetUnfolder]: 66/465 cut-off events. [2022-11-21 16:17:18,344 INFO L131 PetriNetUnfolder]: For 289/304 co-relation queries the response was YES. [2022-11-21 16:17:18,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 465 events. 66/465 cut-off events. For 289/304 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2483 event pairs, 11 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 898. Up to 48 conditions per place. [2022-11-21 16:17:18,347 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 16 selfloop transitions, 1 changer transitions 21/129 dead transitions. [2022-11-21 16:17:18,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 494 flow [2022-11-21 16:17:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:17:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 16:17:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2022-11-21 16:17:18,350 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8548009367681498 [2022-11-21 16:17:18,350 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2022-11-21 16:17:18,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2022-11-21 16:17:18,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:18,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2022-11-21 16:17:18,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:18,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:18,355 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:18,355 INFO L175 Difference]: Start difference. First operand has 139 places, 114 transitions, 335 flow. Second operand 7 states and 730 transitions. [2022-11-21 16:17:18,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 494 flow [2022-11-21 16:17:18,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 461 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-11-21 16:17:18,365 INFO L231 Difference]: Finished difference. Result has 136 places, 108 transitions, 293 flow [2022-11-21 16:17:18,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2022-11-21 16:17:18,367 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2022-11-21 16:17:18,367 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 293 flow [2022-11-21 16:17:18,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:17:18,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:18,368 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-21 16:17:18,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:17:18,369 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-21 16:17:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:18,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1888273907, now seen corresponding path program 4 times [2022-11-21 16:17:18,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606521228] [2022-11-21 16:17:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:17:18,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:17:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:17:18,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:17:18,508 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:17:18,509 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-21 16:17:18,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-21 16:17:18,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-21 16:17:18,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-21 16:17:18,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-21 16:17:18,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-21 16:17:18,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:17:18,514 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-11-21 16:17:18,521 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:17:18,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:17:18,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:17:18 BasicIcfg [2022-11-21 16:17:18,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:17:18,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:17:18,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:17:18,671 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:17:18,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:17:08" (3/4) ... [2022-11-21 16:17:18,673 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 16:17:18,849 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:17:18,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:17:18,850 INFO L158 Benchmark]: Toolchain (without parser) took 11901.14ms. Allocated memory was 180.4MB in the beginning and 268.4MB in the end (delta: 88.1MB). Free memory was 150.9MB in the beginning and 141.3MB in the end (delta: 9.6MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2022-11-21 16:17:18,850 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:17:18,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.13ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 127.8MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-21 16:17:18,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.40ms. Allocated memory is still 180.4MB. Free memory was 127.8MB in the beginning and 124.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:17:18,851 INFO L158 Benchmark]: Boogie Preprocessor took 48.58ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 123.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:17:18,851 INFO L158 Benchmark]: RCFGBuilder took 1013.94ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 92.7MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-21 16:17:18,852 INFO L158 Benchmark]: TraceAbstraction took 9945.85ms. Allocated memory was 180.4MB in the beginning and 268.4MB in the end (delta: 88.1MB). Free memory was 92.1MB in the beginning and 168.6MB in the end (delta: -76.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-11-21 16:17:18,852 INFO L158 Benchmark]: Witness Printer took 178.53ms. Allocated memory is still 268.4MB. Free memory was 167.5MB in the beginning and 141.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-21 16:17:18,854 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.30ms. Allocated memory is still 111.1MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.13ms. Allocated memory is still 180.4MB. Free memory was 150.1MB in the beginning and 127.8MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.40ms. Allocated memory is still 180.4MB. Free memory was 127.8MB in the beginning and 124.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.58ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 123.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1013.94ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 92.7MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9945.85ms. Allocated memory was 180.4MB in the beginning and 268.4MB in the end (delta: 88.1MB). Free memory was 92.1MB in the beginning and 168.6MB in the end (delta: -76.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 178.53ms. Allocated memory is still 268.4MB. Free memory was 167.5MB in the beginning and 141.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L723] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L724] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L725] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L727] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L729] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L731] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L732] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L733] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L734] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L735] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L736] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L737] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L743] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L744] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L745] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L746] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L747] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t852; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t852, ((void *)0), P0, ((void *)0))=-2, t852={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t853; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t853, ((void *)0), P1, ((void *)0))=-1, t852={5:0}, t853={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t854; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t854, ((void *)0), P2, ((void *)0))=0, t852={5:0}, t853={6:0}, t854={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 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) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 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 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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: 848]: 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: 850]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 700 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 152 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=8, InterpolantAutomatonStates: 90, 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.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 4047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:17:18,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4eb7c32-3f2d-48ea-8c06-1a7cff9adec7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE