./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 17:38:18,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 17:38:18,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 17:38:18,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 17:38:18,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 17:38:18,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 17:38:18,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 17:38:18,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 17:38:18,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 17:38:18,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 17:38:18,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 17:38:18,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 17:38:18,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 17:38:18,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 17:38:18,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 17:38:18,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 17:38:18,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 17:38:18,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 17:38:18,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 17:38:18,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 17:38:18,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 17:38:18,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 17:38:18,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 17:38:18,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 17:38:18,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 17:38:18,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 17:38:18,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 17:38:18,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 17:38:18,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 17:38:18,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 17:38:18,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 17:38:18,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 17:38:18,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 17:38:18,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 17:38:18,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 17:38:18,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 17:38:18,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 17:38:18,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 17:38:18,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 17:38:18,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 17:38:18,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 17:38:18,395 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-10-17 17:38:18,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 17:38:18,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 17:38:18,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 17:38:18,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 17:38:18,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 17:38:18,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 17:38:18,432 INFO L138 SettingsManager]: * User list type=DISABLED [2022-10-17 17:38:18,433 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-10-17 17:38:18,433 INFO L138 SettingsManager]: * Explicit value domain=true [2022-10-17 17:38:18,433 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-10-17 17:38:18,434 INFO L138 SettingsManager]: * Octagon Domain=false [2022-10-17 17:38:18,434 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-10-17 17:38:18,434 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-10-17 17:38:18,434 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-10-17 17:38:18,435 INFO L138 SettingsManager]: * Interval Domain=false [2022-10-17 17:38:18,435 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-10-17 17:38:18,435 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-10-17 17:38:18,436 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-10-17 17:38:18,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 17:38:18,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 17:38:18,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 17:38:18,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 17:38:18,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 17:38:18,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 17:38:18,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 17:38:18,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 17:38:18,439 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 17:38:18,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 17:38:18,440 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 17:38:18,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 17:38:18,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 17:38:18,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 17:38:18,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:38:18,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 17:38:18,441 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-10-17 17:38:18,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 17:38:18,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 17:38:18,442 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-10-17 17:38:18,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 17:38:18,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 17:38:18,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-10-17 17:38:18,444 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_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/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_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta 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 -> Taipan 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 -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2022-10-17 17:38:18,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 17:38:18,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 17:38:18,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 17:38:18,872 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 17:38:18,873 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 17:38:18,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-10-17 17:38:18,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/data/00683b622/75eaa0f24d3445e49360ab26c859c412/FLAG890356f36 [2022-10-17 17:38:19,731 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 17:38:19,732 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-10-17 17:38:19,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/data/00683b622/75eaa0f24d3445e49360ab26c859c412/FLAG890356f36 [2022-10-17 17:38:19,962 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/data/00683b622/75eaa0f24d3445e49360ab26c859c412 [2022-10-17 17:38:19,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 17:38:19,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 17:38:19,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 17:38:19,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 17:38:19,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 17:38:19,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:38:19" (1/1) ... [2022-10-17 17:38:19,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dbf59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:19, skipping insertion in model container [2022-10-17 17:38:19,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:38:19" (1/1) ... [2022-10-17 17:38:19,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 17:38:20,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 17:38:20,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-10-17 17:38:20,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:38:20,667 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 17:38:20,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-10-17 17:38:20,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:38:20,800 INFO L208 MainTranslator]: Completed translation [2022-10-17 17:38:20,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20 WrapperNode [2022-10-17 17:38:20,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 17:38:20,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 17:38:20,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 17:38:20,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 17:38:20,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:20,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:20,910 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 195 [2022-10-17 17:38:20,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 17:38:20,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 17:38:20,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 17:38:20,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 17:38:20,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:20,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:20,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:20,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:21,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:21,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:21,022 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:21,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:21,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 17:38:21,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 17:38:21,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 17:38:21,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 17:38:21,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (1/1) ... [2022-10-17 17:38:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:38:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:38:21,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 17:38:21,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 17:38:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 17:38:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 17:38:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 17:38:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 17:38:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 17:38:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 17:38:21,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 17:38:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 17:38:21,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 17:38:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 17:38:21,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 17:38:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-10-17 17:38:21,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-10-17 17:38:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 17:38:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 17:38:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 17:38:21,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 17:38:21,167 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 17:38:21,411 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 17:38:21,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 17:38:22,455 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 17:38:23,106 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 17:38:23,106 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 17:38:23,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:38:23 BoogieIcfgContainer [2022-10-17 17:38:23,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 17:38:23,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 17:38:23,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 17:38:23,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 17:38:23,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:38:19" (1/3) ... [2022-10-17 17:38:23,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac8a87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:38:23, skipping insertion in model container [2022-10-17 17:38:23,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:38:20" (2/3) ... [2022-10-17 17:38:23,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac8a87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:38:23, skipping insertion in model container [2022-10-17 17:38:23,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:38:23" (3/3) ... [2022-10-17 17:38:23,129 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-10-17 17:38:23,138 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 17:38:23,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 17:38:23,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 17:38:23,153 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 17:38:23,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 17:38:23,338 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-10-17 17:38:23,362 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 302 flow [2022-10-17 17:38:23,368 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 302 flow [2022-10-17 17:38:23,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-10-17 17:38:23,493 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-10-17 17:38:23,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 17:38:23,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-10-17 17:38:23,505 INFO L118 LiptonReduction]: Number of co-enabled transitions 3518 [2022-10-17 17:38:31,354 INFO L133 LiptonReduction]: Checked pairs total: 9511 [2022-10-17 17:38:31,354 INFO L135 LiptonReduction]: Total number of compositions: 118 [2022-10-17 17:38:31,364 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2022-10-17 17:38:31,797 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5174 states, 5171 states have (on average 4.175594662541094) internal successors, (21592), 5173 states have internal predecessors, (21592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:31,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 17:38:31,836 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=FINITE_AUTOMATA, 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;@53ee09e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 17:38:31,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-10-17 17:38:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 5174 states, 5171 states have (on average 4.175594662541094) internal successors, (21592), 5173 states have internal predecessors, (21592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-17 17:38:31,874 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:31,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-17 17:38:31,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:31,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1288144, now seen corresponding path program 1 times [2022-10-17 17:38:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:31,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340784493] [2022-10-17 17:38:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:32,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:32,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340784493] [2022-10-17 17:38:32,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340784493] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:32,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:32,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:38:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564043163] [2022-10-17 17:38:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:32,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:38:32,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:38:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:38:32,660 INFO L87 Difference]: Start difference. First operand has 5174 states, 5171 states have (on average 4.175594662541094) internal successors, (21592), 5173 states have internal predecessors, (21592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:32,993 INFO L93 Difference]: Finished difference Result 4212 states and 16640 transitions. [2022-10-17 17:38:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:38:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-17 17:38:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:33,080 INFO L225 Difference]: With dead ends: 4212 [2022-10-17 17:38:33,080 INFO L226 Difference]: Without dead ends: 4062 [2022-10-17 17:38:33,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:38:33,086 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:33,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-10-17 17:38:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-10-17 17:38:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-10-17 17:38:33,553 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2022-10-17 17:38:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:33,554 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-10-17 17:38:33,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-10-17 17:38:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 17:38:33,561 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:33,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:38:33,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 17:38:33,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash 589804522, now seen corresponding path program 1 times [2022-10-17 17:38:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:33,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128520753] [2022-10-17 17:38:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:34,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:34,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128520753] [2022-10-17 17:38:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128520753] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:38:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366040120] [2022-10-17 17:38:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:34,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:38:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:38:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:38:34,056 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:34,449 INFO L93 Difference]: Finished difference Result 4312 states and 16600 transitions. [2022-10-17 17:38:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:38:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-17 17:38:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:34,505 INFO L225 Difference]: With dead ends: 4312 [2022-10-17 17:38:34,506 INFO L226 Difference]: Without dead ends: 3562 [2022-10-17 17:38:34,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:38:34,509 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:34,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 15 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2022-10-17 17:38:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3562. [2022-10-17 17:38:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3562 states, 3561 states have (on average 3.9104184217916313) internal successors, (13925), 3561 states have internal predecessors, (13925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3562 states to 3562 states and 13925 transitions. [2022-10-17 17:38:34,787 INFO L78 Accepts]: Start accepts. Automaton has 3562 states and 13925 transitions. Word has length 12 [2022-10-17 17:38:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:34,788 INFO L495 AbstractCegarLoop]: Abstraction has 3562 states and 13925 transitions. [2022-10-17 17:38:34,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states and 13925 transitions. [2022-10-17 17:38:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-17 17:38:34,803 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:34,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:38:34,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 17:38:34,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2079810539, now seen corresponding path program 1 times [2022-10-17 17:38:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447646428] [2022-10-17 17:38:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:35,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:35,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447646428] [2022-10-17 17:38:35,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447646428] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:35,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:35,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:38:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474419333] [2022-10-17 17:38:35,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:35,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:38:35,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:35,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:38:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:38:35,066 INFO L87 Difference]: Start difference. First operand 3562 states and 13925 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:35,260 INFO L93 Difference]: Finished difference Result 2538 states and 8805 transitions. [2022-10-17 17:38:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:38:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-17 17:38:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:35,292 INFO L225 Difference]: With dead ends: 2538 [2022-10-17 17:38:35,292 INFO L226 Difference]: Without dead ends: 2538 [2022-10-17 17:38:35,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:38:35,294 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:35,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:38:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-10-17 17:38:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-10-17 17:38:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2537 states have (on average 3.4706346078044934) internal successors, (8805), 2537 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 8805 transitions. [2022-10-17 17:38:35,426 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 8805 transitions. Word has length 14 [2022-10-17 17:38:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:35,427 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 8805 transitions. [2022-10-17 17:38:35,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 8805 transitions. [2022-10-17 17:38:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-17 17:38:35,433 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:35,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:38:35,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 17:38:35,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2019110763, now seen corresponding path program 1 times [2022-10-17 17:38:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899922037] [2022-10-17 17:38:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:35,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:35,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899922037] [2022-10-17 17:38:35,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899922037] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:35,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:35,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:38:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929217049] [2022-10-17 17:38:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:38:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:38:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:38:35,974 INFO L87 Difference]: Start difference. First operand 2538 states and 8805 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:36,172 INFO L93 Difference]: Finished difference Result 1514 states and 4709 transitions. [2022-10-17 17:38:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:38:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-17 17:38:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:36,191 INFO L225 Difference]: With dead ends: 1514 [2022-10-17 17:38:36,191 INFO L226 Difference]: Without dead ends: 1514 [2022-10-17 17:38:36,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:38:36,193 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:36,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-10-17 17:38:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-10-17 17:38:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 3.1123595505617976) internal successors, (4709), 1513 states have internal predecessors, (4709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 4709 transitions. [2022-10-17 17:38:36,279 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 4709 transitions. Word has length 17 [2022-10-17 17:38:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:36,279 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 4709 transitions. [2022-10-17 17:38:36,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 4709 transitions. [2022-10-17 17:38:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-17 17:38:36,285 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:36,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:38:36,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 17:38:36,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1558260916, now seen corresponding path program 1 times [2022-10-17 17:38:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:36,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917612477] [2022-10-17 17:38:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:36,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:36,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917612477] [2022-10-17 17:38:36,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917612477] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:36,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:36,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:38:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180376713] [2022-10-17 17:38:36,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:36,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:38:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:36,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:38:36,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:38:36,776 INFO L87 Difference]: Start difference. First operand 1514 states and 4709 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:36,989 INFO L93 Difference]: Finished difference Result 1130 states and 3557 transitions. [2022-10-17 17:38:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:38:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-17 17:38:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:37,009 INFO L225 Difference]: With dead ends: 1130 [2022-10-17 17:38:37,010 INFO L226 Difference]: Without dead ends: 1130 [2022-10-17 17:38:37,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:38:37,014 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 94 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:37,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2022-10-17 17:38:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2022-10-17 17:38:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 3.150575730735164) internal successors, (3557), 1129 states have internal predecessors, (3557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3557 transitions. [2022-10-17 17:38:37,066 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3557 transitions. Word has length 21 [2022-10-17 17:38:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:37,067 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 3557 transitions. [2022-10-17 17:38:37,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3557 transitions. [2022-10-17 17:38:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 17:38:37,073 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:37,074 INFO L195 NwaCegarLoop]: 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] [2022-10-17 17:38:37,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 17:38:37,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1310126221, now seen corresponding path program 1 times [2022-10-17 17:38:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:37,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243992008] [2022-10-17 17:38:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:38,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:38,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243992008] [2022-10-17 17:38:38,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243992008] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:38,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:38,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 17:38:38,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433706651] [2022-10-17 17:38:38,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:38,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 17:38:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:38,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 17:38:38,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-17 17:38:38,007 INFO L87 Difference]: Start difference. First operand 1130 states and 3557 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:38,784 INFO L93 Difference]: Finished difference Result 2381 states and 7496 transitions. [2022-10-17 17:38:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 17:38:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-17 17:38:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:38,802 INFO L225 Difference]: With dead ends: 2381 [2022-10-17 17:38:38,802 INFO L226 Difference]: Without dead ends: 2234 [2022-10-17 17:38:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-10-17 17:38:38,804 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 148 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:38,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 38 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-17 17:38:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2022-10-17 17:38:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1578. [2022-10-17 17:38:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 3.1578947368421053) internal successors, (4980), 1577 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 4980 transitions. [2022-10-17 17:38:38,891 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 4980 transitions. Word has length 25 [2022-10-17 17:38:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:38,891 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 4980 transitions. [2022-10-17 17:38:38,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 4980 transitions. [2022-10-17 17:38:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 17:38:38,899 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:38,899 INFO L195 NwaCegarLoop]: 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] [2022-10-17 17:38:38,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 17:38:38,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1461179911, now seen corresponding path program 2 times [2022-10-17 17:38:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:38,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142077604] [2022-10-17 17:38:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:39,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:39,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142077604] [2022-10-17 17:38:39,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142077604] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:39,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:39,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:38:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122381877] [2022-10-17 17:38:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:39,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 17:38:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 17:38:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:38:39,306 INFO L87 Difference]: Start difference. First operand 1578 states and 4980 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:39,662 INFO L93 Difference]: Finished difference Result 2131 states and 6612 transitions. [2022-10-17 17:38:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 17:38:39,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-17 17:38:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:39,670 INFO L225 Difference]: With dead ends: 2131 [2022-10-17 17:38:39,670 INFO L226 Difference]: Without dead ends: 1330 [2022-10-17 17:38:39,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-10-17 17:38:39,672 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 84 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:39,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 15 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 17:38:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2022-10-17 17:38:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1130. [2022-10-17 17:38:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 3.0) internal successors, (3387), 1129 states have internal predecessors, (3387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3387 transitions. [2022-10-17 17:38:39,722 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3387 transitions. Word has length 25 [2022-10-17 17:38:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:39,722 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 3387 transitions. [2022-10-17 17:38:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3387 transitions. [2022-10-17 17:38:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 17:38:39,731 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:39,732 INFO L195 NwaCegarLoop]: 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] [2022-10-17 17:38:39,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 17:38:39,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1921276651, now seen corresponding path program 3 times [2022-10-17 17:38:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523321565] [2022-10-17 17:38:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:40,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:40,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523321565] [2022-10-17 17:38:40,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523321565] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:40,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:40,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:38:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451697416] [2022-10-17 17:38:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:40,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 17:38:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 17:38:40,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:38:40,163 INFO L87 Difference]: Start difference. First operand 1130 states and 3387 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:40,351 INFO L93 Difference]: Finished difference Result 1066 states and 3261 transitions. [2022-10-17 17:38:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 17:38:40,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-17 17:38:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:40,355 INFO L225 Difference]: With dead ends: 1066 [2022-10-17 17:38:40,355 INFO L226 Difference]: Without dead ends: 730 [2022-10-17 17:38:40,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:38:40,358 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 100 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:40,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 11 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-10-17 17:38:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2022-10-17 17:38:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 3.0246913580246915) internal successors, (2205), 729 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2205 transitions. [2022-10-17 17:38:40,390 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 2205 transitions. Word has length 25 [2022-10-17 17:38:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:40,392 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 2205 transitions. [2022-10-17 17:38:40,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 2205 transitions. [2022-10-17 17:38:40,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-17 17:38:40,395 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:40,396 INFO L195 NwaCegarLoop]: 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] [2022-10-17 17:38:40,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 17:38:40,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash -619731232, now seen corresponding path program 1 times [2022-10-17 17:38:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:40,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294172112] [2022-10-17 17:38:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:40,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:40,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294172112] [2022-10-17 17:38:40,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294172112] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:40,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:40,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:38:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289270030] [2022-10-17 17:38:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:40,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:38:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:38:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:38:40,906 INFO L87 Difference]: Start difference. First operand 730 states and 2205 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:41,163 INFO L93 Difference]: Finished difference Result 988 states and 2942 transitions. [2022-10-17 17:38:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 17:38:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-17 17:38:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:41,169 INFO L225 Difference]: With dead ends: 988 [2022-10-17 17:38:41,170 INFO L226 Difference]: Without dead ends: 850 [2022-10-17 17:38:41,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:38:41,171 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:41,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 14 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-10-17 17:38:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 676. [2022-10-17 17:38:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 2.973333333333333) internal successors, (2007), 675 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2007 transitions. [2022-10-17 17:38:41,205 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 2007 transitions. Word has length 29 [2022-10-17 17:38:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:41,205 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 2007 transitions. [2022-10-17 17:38:41,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 2007 transitions. [2022-10-17 17:38:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-17 17:38:41,212 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:41,212 INFO L195 NwaCegarLoop]: 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] [2022-10-17 17:38:41,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 17:38:41,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1440687352, now seen corresponding path program 2 times [2022-10-17 17:38:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:41,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752095275] [2022-10-17 17:38:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:38:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:38:41,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:38:41,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752095275] [2022-10-17 17:38:41,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752095275] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:38:41,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:38:41,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:38:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111459601] [2022-10-17 17:38:41,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:38:41,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:38:41,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:38:41,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:38:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:38:41,607 INFO L87 Difference]: Start difference. First operand 676 states and 2007 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:41,809 INFO L93 Difference]: Finished difference Result 934 states and 2744 transitions. [2022-10-17 17:38:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:38:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-17 17:38:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:41,812 INFO L225 Difference]: With dead ends: 934 [2022-10-17 17:38:41,813 INFO L226 Difference]: Without dead ends: 560 [2022-10-17 17:38:41,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:38:41,814 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:41,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 20 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:38:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-10-17 17:38:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2022-10-17 17:38:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.9069767441860463) internal successors, (1625), 559 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1625 transitions. [2022-10-17 17:38:41,857 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1625 transitions. Word has length 29 [2022-10-17 17:38:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:41,858 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1625 transitions. [2022-10-17 17:38:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:38:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1625 transitions. [2022-10-17 17:38:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-17 17:38:41,861 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:41,861 INFO L195 NwaCegarLoop]: 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] [2022-10-17 17:38:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 17:38:41,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:38:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1107307418, now seen corresponding path program 3 times [2022-10-17 17:38:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576943398] [2022-10-17 17:38:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:38:41,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 17:38:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:38:42,163 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-10-17 17:38:42,164 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 17:38:42,165 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-10-17 17:38:42,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-10-17 17:38:42,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-10-17 17:38:42,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-10-17 17:38:42,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-10-17 17:38:42,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-10-17 17:38:42,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-10-17 17:38:42,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 17:38:42,173 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-10-17 17:38:42,180 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 17:38:42,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 17:38:42,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 05:38:42 BasicIcfg [2022-10-17 17:38:42,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 17:38:42,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 17:38:42,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 17:38:42,402 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 17:38:42,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:38:23" (3/4) ... [2022-10-17 17:38:42,405 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 17:38:42,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/witness.graphml [2022-10-17 17:38:42,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 17:38:42,550 INFO L158 Benchmark]: Toolchain (without parser) took 22583.95ms. Allocated memory was 115.3MB in the beginning and 341.8MB in the end (delta: 226.5MB). Free memory was 73.0MB in the beginning and 178.1MB in the end (delta: -105.1MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,551 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 115.3MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 17:38:42,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 832.51ms. Allocated memory is still 115.3MB. Free memory was 72.8MB in the beginning and 74.2MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.51ms. Allocated memory is still 115.3MB. Free memory was 74.2MB in the beginning and 71.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,552 INFO L158 Benchmark]: Boogie Preprocessor took 134.39ms. Allocated memory is still 115.3MB. Free memory was 71.7MB in the beginning and 69.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,552 INFO L158 Benchmark]: RCFGBuilder took 2063.95ms. Allocated memory was 115.3MB in the beginning and 157.3MB in the end (delta: 41.9MB). Free memory was 69.2MB in the beginning and 120.9MB in the end (delta: -51.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,553 INFO L158 Benchmark]: TraceAbstraction took 19284.63ms. Allocated memory was 157.3MB in the beginning and 341.8MB in the end (delta: 184.5MB). Free memory was 120.9MB in the beginning and 202.2MB in the end (delta: -81.3MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,553 INFO L158 Benchmark]: Witness Printer took 147.80ms. Allocated memory is still 341.8MB. Free memory was 202.2MB in the beginning and 178.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-10-17 17:38:42,556 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.36ms. Allocated memory is still 115.3MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 832.51ms. Allocated memory is still 115.3MB. Free memory was 72.8MB in the beginning and 74.2MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.51ms. Allocated memory is still 115.3MB. Free memory was 74.2MB in the beginning and 71.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.39ms. Allocated memory is still 115.3MB. Free memory was 71.7MB in the beginning and 69.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2063.95ms. Allocated memory was 115.3MB in the beginning and 157.3MB in the end (delta: 41.9MB). Free memory was 69.2MB in the beginning and 120.9MB in the end (delta: -51.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19284.63ms. Allocated memory was 157.3MB in the beginning and 341.8MB in the end (delta: 184.5MB). Free memory was 120.9MB in the beginning and 202.2MB in the end (delta: -81.3MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. * Witness Printer took 147.80ms. Allocated memory is still 341.8MB. Free memory was 202.2MB in the beginning and 178.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 152 PlacesBefore, 48 PlacesAfterwards, 141 TransitionsBefore, 36 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 9511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4574, positive: 4345, positive conditional: 0, positive unconditional: 4345, negative: 229, negative conditional: 0, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2361, positive: 2293, positive conditional: 0, positive unconditional: 2293, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2361, positive: 2262, positive conditional: 0, positive unconditional: 2262, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 863, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 801, negative conditional: 0, negative unconditional: 801, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4574, positive: 2052, positive conditional: 0, positive unconditional: 2052, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 2361, unknown conditional: 0, unknown unconditional: 2361] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-4, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=-3, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=-2, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=-1, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - 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: 876]: 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: 878]: 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: 880]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 610 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1424 IncrementalHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 52 mSDtfsCounter, 1424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5174occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1030 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 17:38:42,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18686370-498f-4fe3-aa42-ac665b70e20f/bin/utaipan-G1rejxKTta/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